A binary tree is called a height balanced binary tree (OR AVL tree), if
2025
A binary tree is called a height balanced binary tree (OR AVL tree), if
- A.
It is a binary tree where the left and right subtrees are both binary search trees
- B.
It is a binary search tree in which the balance factor of every node is 0
- 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
- D.
It is a binary search tree in which every node has exactly two children
Attempted by 116 students.
Show answer & explanation
Correct answer: C
A binary tree is height-balanced if for every node, the difference between the heights of its left and right subtrees is at most one. This property ensures the tree remains efficient for operations like search, insertion, and deletion.