Assume a hash table is implemented using chaining with bucketsimplemented using AVL trees. What’s the worst-case time complexityof inserting a data item? _____ What’s the worst-case timecomplexity of searching a data item?_____ What’s the worst-casetime complexity of deleting a data item?_____
Answer
The worst-case time complexity of inserting a data item –>O( log n )
The worst-case time complexity of searching a data item –>O( log n )
The worst-case time complexity of deleting a data item –>O( log n )