Question

Which of the following data structures can be efficiently implemented using a linked list?

A Array and Matrix Correct Answer Incorrect Answer
B Stack and Queue Correct Answer Incorrect Answer
C Hash Table with open addressing Correct Answer Incorrect Answer
D Binary Search Tree (only if balanced) Correct Answer Incorrect Answer
E All of the above Correct Answer Incorrect Answer

Solution

Linked lists are a common and efficient way to implement both stacks (LIFO) and queues (FIFO) because insertions and deletions at the ends (head/tail) can be performed in O(1) time.

Practice Next
More Data Structure Questions
ask-question