Comparison of binary search trees, and hash tables:
Which of the below statements are false?
i. binary search trees & heaps have total order for its keys.
ii. find, insert, remove functions on a binary search tree are faster than that of a hash table.
iii. find, insert, remove functions on a binary search tree are slower than that of a hash table.
iv. binary search trees automatically keeps the data in inorder.
find, insert, remove functions in binary search tree are slower than hashtable. But that is not the use case why we use binary search trees. we can quickly find the entry with min or max key, or entry nearest another entry in binary search tree faster than other data structures.
Back To Top