Register

height of the binary tree..
closed

• closed by
247 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. The maximum possible height of such a tree with n nodes is best described by which of the following?

(a) log2n
(b) log4/3n
     (c) log3n
     (d) log3/2n
• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
0 answers
1
Rohit Gupta 8 asked Dec 25, 2017
1,152 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
2
Aman Bisht asked Jun 12, 2017
1,128 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
4 votes
4 votes
1 answer
4
Shashank Chavan asked Jan 18, 2016
11,287 views
What's the difference between Binary tree height, level and depth?
What's the difference between Binary tree height, level and depth? Sometimes it's confusing! Does there definition change according to question also, if mentioned?
What's the difference between Binary tree height, level and depth? Sometimes it's confusing!Does there definition change according to question also, if mentioned?
User Avatar
Link Copied!