In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into a NONEMPTY queue?
(a) Only front pointer
(b) Only rear pointer
(c) Both front and rear pointer
(d) No pointer will be changed
This interesting question is from Queue using Linked List topic in portion Abstract Data Types of Data Structures & Algorithms I
I have been asked this question in semester exam.