0
1.4kviews
Queue ADT using linked list.
1 Answer
0
2views
  • A queue has two basic operations: Insert and delete, the insert operation adds an element to the end of the queue and the delete operation removes the element from the front of the start of the queue.

enter image description here

Fig, Linked Queue.

Program:

include < stdio.h>

include < conio.h>

struct node

< …

Create a free account to keep reading this post.

and 3 others joined a min ago.

Please log in to add an answer.