title: Why don't we use AVL tree for hash table's item storage?
body: <p>Recently, I was looking at the hash table which is using chaining as linked list. I came to the possibility of using the "chain" as AVL tree.
  Therefore, each buckets in the hash table will have little AVL tree's root pointers. Wikipedia says hash table's worst case is O(n) (<a href="http://en.wikipedia.org/wiki/Hash_table" rel="nofollow">http://en.wikipedia.org/wiki/Hash_table</a>). However, if we use each bucket's "chain" as AVL tree, we can bring it down to O(ln n).</p>
  
  <p>Am I missing something?
  As far as I know we can replace a linked list with an AVL tree.
  Wouldn't such ADT be better than single AVL tree or hash table with linked list chaining?</p>
  
  <p>I searched the internet and could not find such ADT.</p>