logo

Queue Implementation using Linked List

   

Added on  2019-09-18

3 Pages442 Words243 Views
 | 
 | 
 | 
Implementation of queue using linked list #include<stdio.h>#include<conio.h>struct Node{ int data; struct Node *next;}*front = NULL,*rear = NULL;void insert(int);void delete();void display();void main(){ int choice, value; clrscr(); printf("\n:: Queue Implementation using Linked List ::\n"); while(1){ printf("\n****** MENU ******\n"); printf("1. Insert\n2. Delete\n3. Display\n4. Exit\n"); printf("Enter your choice: "); scanf("%d",&choice); switch(choice){ case 1: printf("Enter the value to be insert: "); scanf("%d", &value); insert(value); break; case 2: delete(); break; case 3: display(); break; case 4: exit(0); default: printf("\nWrong selection!!! Please try again!!!\n"); } }}void insert(int value){ struct Node *newNode; newNode = (struct Node*)malloc(sizeof(struct Node)); newNode->data = value; newNode -> next = NULL; if(front == NULL) front = rear = newNode; else{ rear -> next = newNode; rear = newNode; } printf("\nInsertion is Success!!!\n");}void delete(){ if(front == NULL) printf("\nQueue is Empty!!!\n"); else{ struct Node *temp = front; front = front -> next;
Queue Implementation using Linked List_1

End of preview

Want to access all the pages? Upload your documents or become a member.

Related Documents
Implementation of Linked List
|5
|1119
|220

Implementation of Stack using Linked List
|3
|427
|344

Interview Questions
|7
|1175
|91

Data Structure - Assignment
|9
|1398
|163

Foundations of Cyber Security
|26
|5206
|328

Vehicle Data Inventory System
|18
|2151
|53