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) .
3782 Points
2464 Points
1832 Points
1494 Points
1096 Points
1054 Points
1050 Points
972 Points
876 Points
642 Points
Gatecse
hi, but according to this post
Nice Post.Thanks,
Congratulations