Queue
A list of data items, commands, etc., stored so as to be retrievable in a definite order,the order of insertion.(First In First Out)
Add an element to Queue
1.Function enqueue( queue[] , data , rear , front , max )
2. If( rear == max )
3. print( “Queue is full” )
4. return
5. end if
6. rear++
7. queue[rear] = data
8.end enqueue
Time complexity :- O(1)
Delete an element from Queue
1.Function dequeue( queue[] , rear , front )
2. If( rear < front )
3. print( “Queue is empty” )
4. return
5. end if
6. front++
7.end dequeue
Time complexity :- O(1)
Traverse the Queue
1.Function traverse_queue( queue[] , rear , front )
2. If( rear < front )
3. print( “Queue is empty” )
4. return
5. end if
6. i = front
7. while( i <= rear)
8. print( queue[i] )
9. i++
10. end while
11.end traverse_queue
Time complexity :- O(n)
