Q114
What is the condition for a tree to be weight balanced. where a is factor and n is a node?
A.
weight[n.left] >= a*weight[n] and weight[n.right] >= a*weight[n].
AnswerB.
weight[n.left] >= a*weight[n.right] and weight[n.right] >= a*weight[n].
C.
weight[n.left] >= a*weight[n.left] and weight[n.right] >= a*weight[n].
D.
weight[n] is a non zero
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board