What is a key characteristic of a balanced binary tree?
A. The height difference between the left and right subtrees is at most 1
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
This Question Belongs to Data Structure >> Trees In Data Structures
Join The Discussion