Queue Implementation Using Doubly Linked List
Learn how to implement a queue by using a doubly linked list in this lesson.
A double-ended queue or a deque (sometimes pronounced “deck”) is an abstract data type in which elements can be added to or removed from both ends. Let’s look at the linked list implementation of the deque.
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.