MR. APURBA PAUL

#include<stdio.h> #include<stdlib.h> int MAX=0;//Max elements in the queue typedef struct mynode { char info; int pri; struct mynode...

#include<stdio.h> int MAX=0; int front=0; int rear=-1; int queue[100]; //Empty int isEmpty() { if(front==0 && rear==-1) return 1;...

#include<stdio.h> int MAX=0; int front=-1; int rear=-1; int queue[100]; //Empty int isEmpty() { if(rear==-1) return 1; else return...

#include<stdio.h> typedef struct mynode { int coeff,expo; struct mynode *Link; }Node; Node *start=NULL,*start2=NULL; //Display Function...

#include<stdio.h> typedef struct mynode { int info; struct mynode *Link; }Node; Node *start=NULL,*start2=NULL; //Display Function void...

Circular Linked List- Doubly Circular Doubly Linked List has properties of both doubly linked list and circular linked list in which two...

//Function to delete a node at the end of the doubly linked list void delete_end() { Node *temp; temp=last; temp->lptr->rptr=NULL;...

//Function to Insert a node at the end of the doubly linked list void add_node(int data) { Node *newptr=NULL; newptr=(Node*)malloc(sizeof...

This Function accepts two list and concat second list with first list. //Concat Function void display_cat() { Node1...

This Function search an element from the list(if successful) otherwise not. //Search Function void search() { int data,flag=0;...

This function prints the summation of the information of each node. //Sum Function void sum() { int sum=0; Node *tptr=start;...

The nodes of the List can be deleted from three positions of the List: 1. Delete the last node of the list 2. Delete the first node of...

A Node can be created in three positions of a linked list: 1. At the end of the List 2. At the beginning of the List 3. At any desired...