Register

Binary Tree Height

14,380 views

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
0 answers
2
Rohit Gupta 8 asked Dec 25, 2017
1,148 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,124 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
2 votes
2 votes
1 answer
4
vijaycs asked May 25, 2016
12,828 views
Minimum number of nodes in a full binary tree with height 3?
User Avatar
Link Copied!