Multiple choice technology programming languages

C++

  1. Binary Tree

  2. Hash Table

  3. Stack

  4. None of the Above

Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Hash tables provide O(1) average time complexity for key-based lookups, making them ideal for scenarios requiring fast data retrieval by key. Binary trees have O(log n) lookup time, while stacks follow LIFO order and don't support efficient key-based access.