Which of the following is TRUE?
if we find the maximum height with minimum no of nodes then the height H = n/2 , without violating the property of the AVL tree . Then the cost of searching in AVL tree could be O(n/2) . Not always necessary to be Log(n) .
^ go through