+1 vote
in Data Structures & Algorithms I by (110k points)
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 Answer

+1 vote
by (672k points)
selected by
Best answer
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.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.