All Questions
Tagged with binary-search-trees hash-tables
3 questions
0
votes
0
answers
31
views
Create a class or structure like union of ranges
How to create a structure which acts as union of ranges. In that structure new ranges can be inserted beforehand and then some queries are asked to find out if the given point is covered by any of the ...
4
votes
1
answer
4k
views
BST representation of Hash Tables
I'm reading this book Cracking Coding Interview. In this book author is speaking about BST representation of Hash Tables.
I googled a lot for BST Representation of Hash Table. Code in C++ but didn't ...
- 209
5
votes
4
answers
4k
views
Why use binary search trees when hash tables exist?
Hash tables perform lookup, insertion, and deletion in O(1) time (expected and amortized) while the different variants of binary search tree (BST) - treap, splay, AVL, red-black - offer at best O(log ...
- 581