A binary tree is called a height balanced binary tree (OR AVL tree), if

2025

Answer: C. It is a binary search tree in which for every node, the heights of the left and right subtrees differ by at most 1

1. A.

   It is a binary tree where the left and right subtrees are both binary search trees

2. B.

   It is a binary search tree in which the balance factor of every node is 0

3. C.

   It is a binary search tree in which for every node, the heights of the left and right subtrees differ by at most 1

4. D.

   It is a binary search tree in which every node has exactly two children

Attempted by 287 students.