Data Structure: Unit II (b): Queue
Concept of Queue
Definition, Example Operations | ADT Data Structure
The queue can be formally defined as ordered collection of elements that has two ends named as front and rear. From the front end one can delete the elements and from the rear end one can insert the elements.
Concept of Queue
• Definition:
The
queue can be formally defined as ordered collection of elements that has two
ends named as front and rear. From the front end one can delete the elements
and from the rear end one can insert the elements.
• For Example :
The
typical example can be a queue of people who are waiting for a city bus at the
bus stop. Any new person is joining at one end of the queue, you can call it as
the rear end. When the bus arrives the person at the other end first enters in
the bus. You can call it as the front end of the queue.
Following Fig. 3.1.1 represents the queue of few element
Data Structure: Unit II (b): Queue : Tag: : Definition, Example Operations | ADT Data Structure - Concept of Queue
Related Topics
Related Subjects
Data Structure
CS3301 3rd Semester CSE Dept | 2021 Regulation | 3rd Semester CSE Dept 2021 Regulation