Q79
What data structure is ideal for implementing a system that requires quick lookups and frequent updates with a small range of possible keys?
A.
Linked List
B.
Trie
C.
Heap
D.
Hash Table
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board