Blog – Latest Posts

#include #include struct node{ int info; struct node *link; }*front=NULL,*rear=NULL; void insert(int num); int del(); void display(); main() { int choice, num; while(1) { printf("\n1 Insert\n"); printf("2 Delete\n"); printf("3 Display\n");…

A queue has two ends front and the rear end. In a queue elements are added from the rear end and they are deleted from the front end of the…

Previous method: https://marxtudor.com/stack-using-linked-list-c-program/ In this method pointer variable top is not declared in the global section its declared in the main() function. So we need to return the value of…

Another approach to create the same program https://marxtudor.com/c-program-implementing-stack-using-a-linked-list/ Implementing stack using a linked list #include #include struct node { int info; struct node *link; }*top=NULL; void push(int num); int pop();…

When implementing stack using an array we make an array behave like a stack in the same way here we need to make a linked list behave like a stack…

struct node *reverse(struct node *start) { struct node *previous, *ptr, *next; previous = NULL; ptr = start; while(ptr!=NULL) { next=ptr->link; ptr->link=previous; previous=ptr; ptr=next; } start=previous; return start; }

void search(struct node *start, int num2) { struct node *p=start; int pos=1; while(p!=NULL) { if(p->info==num2) { printf("%d found at pos %d",num2); return; } p=p->link; } printf("num2 %d not found in…

void count(struct node *start) { int count = 0; struct node *p=start; while(p!=NULL) { p=p->link; count++; } printf("Number of nodes %d ", count); }

#include #include struct node{ int info; struct node *link; }; void display(struct node *start); struct node *addatbeg(struct node *start, int num); void addatend(struct node *start, int num); struct node *del(struct…

A linked list is an abstract data type which contains elements of same data type arranged in sequential order. Just as an array is used to store elements in the…