In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into EMPTY queue?
(a) Only front pointer
(b) Only rear pointer
(c) Both front and rear pointer
(d) No pointer will be changed
This intriguing question originated from Queue using Linked List topic in portion Abstract Data Types of Data Structures & Algorithms I
This question was posed to me in quiz.