- A queue is a special kind of a list in which all
items are inserted at one end (called the
**rear**or the**back**or the**tail**) and deleted at the other end (called the**front**or the**head**) - useful in
- simulation
- breadth-first search in graphs
- tree and graph algorithms

- The Queue ADT is a special case of the List ADT, with the following
typical operations
- 1.
- makenull (Q)
- 2.
- front (Q) retrieve (first (Q), Q)
- 3.
- enqueue (x, Q) insert (x, end(Q), Q)
- 4.
- dequeue (Q) delete (first (Q), Q)
- 5.
- empty (Q)

- Implementation : Pointers, Circular array, Circular linked list

- 2.4.1 Pointer Implementation
- 2.4.2 Circular Array Implementation
- 2.4.3 Circular Linked List Implementation

eEL,CSA_Dept,IISc,Bangalore