OPERATIONS ON QUEUE
- Queue is a non primitive linear data structure.
- It is an homogenous collection of elements in which new elements are added at one end called the REAR end and the existing elements are deleted from other end called the FRONT end.
Implementation of QUEUE
- Static implementation (using arrays)
- Dynamic implementation (using pointers)
Total Elements
Total elements present within a queue are :
front – rear + 1
Operations on a Queue
Basic operations that can be performed on a queue are :
- To insert an element in a queue
- To delete an element from the queue
TECHIE MASH 