Made Easy Test Series: Binary Tree

Question

The number of node in each left subtree is within a factor of $2.$ of the number of nodes in the corresponding right subtree. Also a node allowed to have only one child if that child has no children. This tree has worst case height $O(logn)$. $N$ is the number of nodes in the binary tree.

Is this statement TRUE about Binary Tree?

Comments

What is the meaning of "The number of node in each left subtree is within a factor of 2.2. of the number of nodes in the corresponding right subtree."?

---

Donot know

They gave solution like this

$N(0)=0$

$N(1)=1$

$N(2)=2$

$N(h)=1+N\left ( h-1 \right )+\frac{1}{2}N\left ( h-1 \right )$

        $=1+\frac{3}{2}N\left ( h-1 \right )$

$N(h)=\Theta \left ( \frac{3}{2} \right )^{h}$

---

Yes, this statement is true as a full binary tree satisfies the condition