queue using double-ended linked list

Queue using Double-Ended Linked List: Example

Stacks and Queues are ADTs (Abstract Data Types). In our previous article we have seen how to implement Stack using Linked List. In this this article you will learn how to implement Queue using Double-Ended Linked List.

What is ADT ?

ADT (Abstract Data Types) in data structures terminology we can say it is a way of looking at a data structure, focusing on what the data structure does instead of how it does. Stacks and Queues are examples of ADTs.

Queue using Double-Ended Linked List: Example

Output

Recommended Posts

References

Leave a Reply

avatar
  Subscribe  
Notify of