Register

How to form a recurrence for finding the height of a weight balanced binary tree?
closed

• closed by
433 views
0 votes
0 votes
closed as a duplicate of: GATE CSE 2002 | Question: 2.12

A weight balanced tree is a binary tree in which for each node, the no. of nodes in the left subtree is atleast half and at most twice the no. of nodes in the right sub tree. So how to approach for forming a recurrence for finding the height of this weight balanced binary tree ?

• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

4 votes
4 votes
1 answer
1
dd asked Feb 8, 2017
1,117 views
Balanced tree Minimum no of nodes for height h
User Avatar
1 votes
1 votes
0 answers
2
Rohit Gupta 8 asked Dec 25, 2017
1,137 views
If the average depth of a node in an n-node binary search tree is O(lg n), then the height of the tree is
If the average depth of a node in an $n$-node binary search tree is $O(\log{n})$, then the height of the tree is$O(n\log{n})$$O(n)$$O(\log{n})$$O(\sqrt(n\log{n}))$
User Avatar
0 votes
0 votes
2 answers
3
Aman Bisht asked Jun 12, 2017
1,119 views
the height of a binary tree
The height of a binary tree having 'i' nodes at level 'i' considering root to be at level 1 is ------. where 'n' is the total no of nodes in the tree. A. O(logn) B. O(n) C. O(ROOT(N)) D. O(N2)
The height of a binary tree having 'i' nodes at level 'i' considering root to be at level 1 is . where 'n' is the total no of nodes in the tree.A. O(logn)B. O(n)C. O(R...
User Avatar
Link Copied!