A complete n-ary tree is a tree in which each node has n children or no…

GATE · 2007 · CS

A complete n-ary tree is a tree in which each node has n children or no children. Let I be the number of internal nodes and L be the number of leaves in a complete n-ary tree. If L = 41, and I = 10, what is the value of n?

  1. A.

    3

  2. B.

    4

  3. C.

    5

  4. D.

    6

Attempted by 446 students.

Show answer

Correct answer: C

The worked solution is available to enrolled students.

Video solution available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2

Loading lesson…