Dequeues as a linear abstract data type

- [Instructor] Let's talk through…what makes the deque class unique…in comparison to other linear data structures.…And also touch on the basic functionality…we need a deque to have.…First of all, deque stands for double-ended queue…where we take the D, the E,…and the first three letters of queue…and put them all together…to create this new word called deque.…High level definition of a deque…is that it's an abstract data type…that resembles both a stack and a queue.…Deques can hold a collection of items…and order is sort of preserved in a deque.…

You'll see soon why I use the phrase sort of.…In a deque, you can add items both to the front…and to the back and you can remove items…from the front and back as well.…When it comes to implementing a deque,…our first consideration is whether or not…Python has a built-in data type…that we could use behind the scenes.…Just like for the stack and queue data structures,…we can use a list to implement a deque…because a list is an ordered collection of items…that we can modify.…