An AVL tree is a self – balancing binary search tree, in which the heights of the two child sub trees of any node differ by _________
An AVL tree is a self – balancing binary search tree, in which the heights of the two child sub trees of any node differ by _________ Correct Answer At most one
In an AVL tree, the difference between heights of the two child sub trees of any node is at most one. If the height differs by more than one, AVL tree performs rotations to balance the tree.