Data structures

Question

A 3-ary tree is a tree in which every internal node has exactly 3 children. Use induction to prove that the number of leaves in a 3-ary tree with n interval nodes is 2(n-1)+3.

Comments

@Vaishnavi01

did you want just proof or especially Induction proof?

if you want especially induction proof, but why ? ( i mean in GATE, they didn't ask descriptive questions )

---

but correct answer is  : $\frac{2 n + 1}{3}$