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
- O(log n)
- n+1
- n
is the question asling that number of leaves in LST of any node should be < numbe rof leaves in RST.if that is the case then it should be maximum 'n' height when we draw a skewed tree.
if its not the case,then what is question saying..??