I have implemented the queue with a linked list keeping track-03627
I have implemented the queue with a linked list, keeping track of a front pointer and a rear pointer. Which of these pointers will change during an insertion into an EMPTY queue?
This multiple choice question (MCQ) is related to the book/course
vu cs301 Data Structures.
It can also be found in
vu cs301 Mid Term - Quiz No.12.
I have implemented the queue with a linked list, keeping track of a front pointer and a rear pointer. Which of these pointers will change during an insertion into an EMPTY queue?
Neither changes
Only front pointer changes.
Only rear pointer changes.
Both change.
