Blog – Classic (with sidebar)

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…

/***************www.marxtudor.com****************/ #include #include #define MAX 5 void insert(int); int del(); void display(); int cqueue[MAX]; int front=-1; int rear=-1; main() { int choice, num; while(1) { printf("nEnter your choicen"); printf("1. Insertn");…

In a simple queue when the Rear reaches the last position or if Rear is equal to MAX-1 then insertion is not possible. See the above two images in the…

/*************** BY Marxtudor www.marxtudor.com/ ***************/ #include #define MAX 5 void insert(int); int del(); void display(); int queue[MAX]; int front=-1; int rear=-1; main() { int choice, num; while(1) { printf("nEnter your…