Complexity of dynamic hash table using AVL tree

Question

What is the worst-case complexity of dynamic hash where instead of chain-hashing there will be an AVL tree in each array element of the table?

If the hash-table wasn't dynamic, the WC complexity would be O(logn) for insert, find and delete. But how would the dynamic hash-table affect these complexities?

By "dynamic hash table," do you mean "a hash table with insertions and deletions allowed," or are you referring to something else? — templatetypedef
– templatetypedef, Commented May 21, 2014 at 23:15

Arun · Accepted Answer · 2014-09-19 22:55:50Z

0

With linear chaining, the worst case happens when (1) all elements hash to the same bucket, and (2) the client is looking for the last element in the bucket.

With AVL tree, the #1 part still stays the same, but the #2 part gets better because instead of searching in a (unsorted) linked list, we are now searching in a height balanced BST, which is an improvement from linear complexity to logarithmic complexity.

answered Sep 19, 2014 at 22:55

Arun

20.6k12 gold badges54 silver badges61 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Complexity of dynamic hash table using AVL tree

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related