complete binary tree / Induction left and right child

45 Views Asked by At

I have an complete binary tree. I want to show: If I choose node $i$, then the index of the left kid will be $2i+1$ and the index of the right child will be $2i+2$. How can I proof that using induction?