A complete n-ary tree is one in which every node has 0 or n sons. If x is the…

GATE · 1998 · CS · Question 2 subparts

A complete n-ary tree is one in which every node has 0 or n sons. If x is the number of internal nodes of a complete n-ary tree, the number of leaves in it is given by

  1. A.

    x(n−1)+1

  2. B.

    xn−1

  3. C.

    xn+1

  4. D.

    x(n+1)

Attempted by 607 students.

Show answer

Correct answer: A

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…