In a complete k-ary tree, every internal node has exactly k children. The…

GATE · 2005 · CS

In a complete k-ary tree, every internal node has exactly k children. The number of leaves in such a tree with n internal nodes is

  1. A.

    nk

  2. B.

    (n - 1)k + 1

  3. C.

    n(k - 1) + 1

  4. D.

    n(k - 1)

Attempted by 561 students.

Show answer

Correct answer: C

The worked solution is available to enrolled students.

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

Loading lesson…