+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is the advantage of a hash table over BST?

(a) hash table has a better average time complexity for performing insert, delete and search operations

(b) hash table requires less space

(c) range query is easy with hash table

(d) easier to implement

I want to ask this question from Hash Tables in portion Hash Tables of Data Structures & Algorithms I

The question was posed to me in an online interview.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right answer is (a) hash table has a better average time complexity for performing insert, delete and search operations

The best explanation: Hash table and BST both are examples of data structures. Hash table has an advantage that it has a better time complexity for performing insert, delete and search operations.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...