Vidyalelo
Data Structure · Q11

Trees in Data Structures

Programming · Data Structure · question 11

Q11

What is a key characteristic of a balanced binary tree?

A.
The height difference between the left and right subtrees is at most 1
Answer
B.
The left subtree is always smaller than the right subtree
C.
The right subtree is always smaller than the left subtree
D.
All levels of the tree are completely filled

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board