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
What is the condition for a tree to be weight balanced. where a is factor and n is a node?
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
What is the condition for a tree to be weight balanced. where a is factor and n is a node?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!