Which of the following symbol table implementation is best suited if access time is to be minimum ? 

The correct answer is Hash Table

Key Points

• All of the data structures you listed can be used to implement a symbol table, but they offer different trade-offs between operation times (like insertion, deletion, access).
• Our primary concern is minimizing access time, then use Hash Table.
• A Hash Table can provide constant time O(1) average case complexity for lookup operations, assuming a good hash function and well-distributed data.
• This means that, on average, lookup time remains constant regardless of the number of elements in the table. Potential downside is that in worst case scenario (all keys collide), it can degrade to O(n).