A binary tree is balanced if the difference between left and right subtree of every node is not more than ____

Category: QuestionsA binary tree is balanced if the difference between left and right subtree of every node is not more than ____
Editor">Editor Staff asked 4 weeks ago

A binary tree is balanced if the difference between left and right subtree of every node is not more than ____
 
(a) 1
 
(b) 3
 
(c) 2
 
(d) 0
 
The question is from Binary Trees in portion Binary Trees of Data Structures & Algorithms I
 
I got this question during an online exam.

1 Answers
Editor">Editor Staff answered 4 weeks ago

Right option is (a) 1
 
Best explanation: In a balanced binary tree the heights of two subtrees of every node never differ by more than 1.