Question: What is the condition for a tree to be weight balanced. where a is factor and n is a node?
Options
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
Previous ||
Data Structure Weight Balanced Tree more questions
In determination of carbon and hydrogen by ultimate analysis, increase....
The water–cement ratio is the ratio of _______________
The sound insulation of plastered solid brick masonry walls varies....
Why are unfloated instruments with ball bearings not suitable for....
Which of the following is NOT a type of area....
The coefficients of the equation formed in the Rhie-Chow interpolation....
For linearizing the source term, which of these methods is....
Which of these methods is used to overcome the high....
The SIMPLE algorithm is a ____________
Data Structure Adjacency List more Online Exam Quiz
Data Structure Undirected Graph
Data Structure Uniform Binary Search
Data Structure Wagner Fischer Algorithm
Data Structure Xor Linked List
Dc Machines Applications Dc Machines