In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?
A. Insertion
B. Deletion
C. To empty a queue
D. Both Insertion and To empty a queue
Answer: Option D
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