Multiple choice technology In AVL tree, the height of two child sub trees of any node differ by Depends on application Atmost one Atmost two None of the above Reveal answer Fill a bubble to check yourself B Correct answer Explanation An AVL tree is a self-balancing binary search tree where the balance factor of any node (the difference between the heights of its left and right subtrees) must be at most one (-1, 0, or 1).