Data Structure: Unit II (b): Queue
Queue ADT
Syntax, Example Operations | Data Structure
The queue is a collection of elements in which the element can be inserted by one end called rear and elements can be deleted by other end called front.
Queue ADT
AbstractData Type Queue
{
Instances: The queue is a collection
of elements in which the element can be inserted by one end called rear and
elements can be deleted by other end called front.
Operations:
1. Insert The insertion of the element in
the queue is done by the end called rear. Before the insertion of the element
in the queue it is checked whether or not the queue is full.
2. Delete: The deletion of the element
from the queue is done by the end called front. Before performing the delete
operation it checked whether the queue is empty or not.
Data Structure: Unit II (b): Queue : Tag: : Syntax, Example Operations | Data Structure - Queue ADT
Related Topics
Related Subjects
Data Structure
CS3301 3rd Semester CSE Dept | 2021 Regulation | 3rd Semester CSE Dept 2021 Regulation