Question: What is the time complexity of searching for an element in an AVL tree?
Options:
Correct Answer: O(log n)
Solution:
The time complexity for searching in an AVL tree is O(log n) due to its balanced nature, which ensures that the height of the tree is logarithmic with respect to the number of nodes.