Queue

Queue

Queue is a linear data structure works according to the FIFO(First-In-First-Out) order. Queue is implement on array and linklist. The easiest way in queue is array. There are two ends of queue first is used for insert is called (Rear) and second is used for delete is called front. firstly front and rear are on (-1) if the value is insert in queue the rear and front is shift on (0) index. and if the next element is insert  the rear is shift on next index and front remains on 0 index. so the value is inserted the rear is increased if the value is delete so the front is shift on next index and value is deleted.  There are different types of queue are as follow

  • Linear queue       
  • Circular queue
  • Priority queue

Linear queue:

  In la linear queue data is insert and delete sequentially. data is insert from the rear and delete from front  sequentially.

Circular Queue:

 

Linear Queue

Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry’s standard

It is a long established fact that a reader will be distracted by the readable content of a page when looking at its layout.

Circular Queue

Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry’s standard

It is a long established fact that a reader will be distracted by the readable content of a page when looking at its layout.