10. You have a hash table that uses the separate chaining collision resolution method. However, instead of chaining elements using a linked list, this hash table chains elements using an AVL tree (see diagram). What is the worst-case time complexity of searching for an element in this hash table, if it contains n elements? Assume the hash function runs in $\Theta(1)$ time. A. $\Theta(1)$ B. $\Theta(\log n)$ C. $\Theta(n)$ D. $\Theta(n \log n)$ E. $\Theta\left(n^{2}\right)$

Public Answer

PICQXL The First Answerer