title: Hash table - implementing with Binary Search Tree
body: <p>From <em>Cracking the Coding Interview</em>, page 71:</p>
  
  <blockquote>
    <p>Alternatively, we can implement hash table with a BST. We can then
    guarantee an O(log n) lookup time, since we can keep the tree
    balanced. Additionally we may use less space, since a large array no
    longer needs to be allocated in the very beginning.</p>
  </blockquote>
  
  <p>I know the basics of linked lists, hash tables and BSTs, but I am unable to understand these lines.  What does it actually mean?  Would this final data structure would be a Trie? </p>