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

(b) 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

My question is taken from Weight Balanced Tree topic in section Binary Trees of Data Structures & Algorithms I

This question was addressed to me during an interview.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right option is (a) weight[n.left] >= a*weight[n] and weight[n.right] >= a*weight[n].

For explanation: The tree is said to be a-balanced if the condition is satisfied. and ‘a’ value will be determined during tree formation. large value of ‘a’ is more effective.

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.

Categories

...