In a balanced binary tree, the height of two sub-trees of every node can not differ by more than
Show answerHide answer
Correct answer: (B) 1
Explanation
In a height-balanced (AVL) binary tree, the heights of the left and right subtrees of every node differ by at most 1.