Introduction of Queue ADT in python |What is Queue data structure in python| Queue ADT in python | Explain Queue data structure|
Queue Abstract data structure
1. Queue is simple data structure which work on the simple principle of “First In First Out”
2. A Queue is a specialized list with a limited number of operations in which items can only be added to one end and removed from the other.
A queue is also known as first in first out (FIFO) list .
3.just like an ordinary queue at a coffee shop or ticket counter etc .where the first one to enter the queue gets served first.
4. In a queue a new element is added from the rear and existing element are removed from the front.
The definition of the queue ADT follows :
 |
| Fig- 1 Abstract view of the a queue Containing five items . |
Fig-1 which illustrates an abstract view of a queue .
New items are inserted into a queue at the back or rear while existing item are removed from the
Front.
Even through the illustration shows the individual items they cannot be accesses directly.
Post a Comment