Blog – Latest Posts

/***************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…

Declare an array to implement queue int queue[MAX]                (MAX is the size of the array / queue) Declare and initialize front and rear to -1 int front = -1;…

Queue is a linear data structure in which elements can be inserted only from the rear end of the queue and can be deleted only from the front end of…

/*************** BY Marxtudor www.marxtudor.com/ ***************/ #include #define MAX 5 void push(int); int pop(); void display(); int top = -1; int stk[MAX]; main() { int choice; int num; while(1) { printf("nEnter…

Declare array to implement stack: int stk[MAX];                  | MAX is the size of the stackDeclare and Initialize top: int top = -1;      Stack should initially be empty and if …

Stack is a linear data structure in which elements can be inserted and deleted only from the top of the stack. Stack can be implemented by using: Array Linked List…

To understand data structure first you need to know what are abstract data types. Some of  the abstract data types are stack, queue, link list, tree etc. Abstract data types…