BST and hash table trade-offs

A hash table with good design (note is well-designed) is O (1) for the following operations

• Search
• Insert
• Delete

And self-balancing BST These operations are O (LOGN)

So above these operations on the hash table better, but if there are the following requirements scenario, BST than hash table with the appropriate

• Get all the content and it's sorted.
• Order statistics, finding closest lower and greater elements, doing range queries is easy-to-do with bsts
• For BST, those basic operations are O (LOGN), although the hash table average time is O (1), but a specific operation is O (n) (resize hash table)

2015-08-16

BST and hash table trade-offs