C Programming and Data Structures: Unit III: b. Linear Data Structures Stacks and Queues
Queue ADT
Operations, Structure
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.
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.
}
C Programming and Data Structures: Unit III: b. Linear Data Structures Stacks and Queues : Tag: : Operations, Structure - Queue ADT
Related Topics
Related Subjects
C Programming and Data Structures
CS3353 3rd Semester EEE, ECE Dept | 2021 Regulation | 3rd Semester EEE Dept 2021 Regulation