282 views
0 votes
0 votes
The number of leaves (nodes with no children) in each left sub tree is within one of the number of leaves in the corresponding right sub tree. What is the worst case height of the tree ? Assume root node at level 0

A.O(log n)

 B.n

 C.n+1

 D.n-1

Please explain the solution properly

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
0 votes
0 votes
0 answers
2
Na462 asked Jan 16, 2019
374 views
Consider a binary tree for every node | P - Q | <= 2. P represents number of nodes in left subtree of S and Q represents number of nodes in right subtree of S for h 0. T...
0 votes
0 votes
1 answer
3
akankshadewangan24 asked Jan 12, 2019
316 views
Can binary serach tree have duplicate elements in the tree?
0 votes
0 votes
0 answers
4