Consider the following queue Q.
After performing the below operation, How many more dequeue operations are required to get index 3 become starting node of the queue.
Enqueue(25)
Enqueue(19)
Hint:
Consider the starting index is 0, if the queue is empty its index is -1.
1
1
2
2
3
3
4
4