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