Q98
A binary tree is balanced if the difference between left and right subtree of every node is not more than . . . . . . . .
A.
1
AnswerB.
3
C.
2
D.
0
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board