This presentation gives an in-depth knowledge of queue data structure

1. QUEUE
TUTORIAL 3

2. WHAT IS QUEUE ?
IT’S A DATA STRUCTURE WHERE YOU ADD ITEMS TO THE
END AND REMOVE ITEMS FROM THE FRONT
When you ADD an item, its called ENQUEUE
When you REMOVE an item, its called DEQUEUE
FIRST IN FIRST OUT (FIFO)

3. ENQUEUE & DEQUEUE
I n i t i a l i z e
Q u e u e q
q . e n Q ( r a t )X = q . d e Q ( )X = q . d e Q ( )
q . e n Q ( c a t )q . e n Q ( b a t )
X = q . d e Q ( )
rat
cat
ball
rat
cat
ball
cat
ball
bat
cat
ball
bat
ball
bat
bat
rat
cat
q . e n Q ( b a l l )

4. HOW ARE QUEUES IMPLEMENTED ?
ARRAY Implementation
56 56
q.enQ(56) q.deQ()q.enQ(90)rear = -1
3
2
1
0
3
2
1
0
3
2
1
0
3
2
1
056
90
front =
rear = 90
front =
front =
rear =
front =
rear =
rear =
front =