Multiple choice technology programming languages

Which of the following data structures is on average the fastest for retrieving data:

  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 average O(1) lookup time due to direct indexing through hash functions. Binary trees provide O(log n) lookup. Stacks provide O(1) but only for LIFO access, not general retrieval. Hash tables are fastest on average for general data retrieval.