Multiple choice Search tables used by compilers for efficient searching generally use hash tables linear list of records binary search tables binary search trees Reveal answer Fill a bubble to check yourself A Correct answer Explanation Hash tables provide average-case constant time complexity for search operations, making them the most efficient choice for symbol tables in compilers.