The number of leaf nodes in a rooted tree of n nodes, with each node having 0…

GATE · 2002 · CS · Question 2 subparts

The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or 3 children is:

  1. A.

    n/2

  2. B.

    (n - 1)/3

  3. C.

    (n - 1)/2

  4. D.

    (2n + 1)/3

Attempted by 667 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…