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
C. Binary Search Tree
D. Linked List
Answer: Option B
This Question Belongs to Data Structure >> Applications Of Data Structures
Join The Discussion