Q30
What data structure is ideal for performing fast lookups, insertions, and deletions with a balanced trade-off between these operations?
A.
Linked List
B.
Hash Table
AnswerC.
Binary Search Tree
D.
Linked List
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board