1. Advanced Data Structure using C++

queue
LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
1
A(front)
2
B
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 143 ‐
3
C
4
D
5
E(rear)
Delete A B(front) C D E(rear)
INTRODUCTION TO CIRCULAR QUEUES :
Delete B C(front) D E(rear)
Delete C D(front) E(rear)
Delete D E(rear)(front)
Delete E(f=0,r=0)
A circular queue is that queue in which the insertion of new element is done at the very
first location of the queue. if the last location of queue is full , in other words if we have
a queue denoted by Q which consist of n element then after inserting an element at last
location of the array the next element will be inserted at very first location of the array.
If a queue is full then no further elements can be inserted into it. So it is possible to
insert new element iff some location in a queue are empty.
A circular queue is a type of queue in which the first element comes just after the last
element. it can be represented by loop of wire , in which the two ends of the wire are
connected together.