681 views
1 votes
1 votes
A weight balanced tree is a binary tree in which for each node, the no. of nodes in the left sub tree is atleast half and at most twice the no. of nodes in the right sub tree. The maximum possible height of such a tree with n nodes is best described by?

Please explain me how to write recurrence relation for such questions

Please log in or register to answer this question.

Related questions

5 votes
5 votes
1 answer
1
VS asked Jan 14, 2018
933 views
A balanced binary search tree of n nodes,the number of steps needed to find and remove the 9th largest element in the worst case?(Please mention the algorithm followed)
0 votes
0 votes
1 answer
2
radha gogia asked Apr 7, 2016
554 views
A node is height balanced if difference between height of left subtree and right subtree is either -1 , 0 or 1 , so how to count such nodes , without maintaining any extr...
0 votes
0 votes
1 answer
3
sandip kushvah asked Dec 30, 2015
861 views
Let G be a simple undirected complete and weighted graph with vertex set V={0,1,2..99}.Weight of edge (u,v) is |u-v| where 0<=u,v<=99 and u not equal to v.Weight of the c...