The GATE Grind

GATE 2007 CS – Question 43

Programming and Data Structures · Trees and Binary Search Trees · 2 marks · Multiple choice

A complete n-ary tree has either n children or none at each node. It has I internal nodes and L leaves. If L=41, I=10, find n.

  1. 3
  2. 4
  3. 5
  4. 6

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (C) 5

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Trees and Binary Search Trees questions

All Trees and Binary Search Trees questions →