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

PYQ GATE 1998

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 743 students.

Sign up free to check your answer

Sign up free

Explore the full course: Data Structures

Loading lesson…