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
Answer: Option C
This Question Belongs to Data Structure >> Introduction To Data Structures
Related Questions on Introduction to Data Structures
A. A collection of data values
B. A programming language
C. A set of algorithms
D. A way of organizing and storing data
Join The Discussion