If a tree has n nodes and for every node there can be either 0 or 3 children,…

If a tree has n nodes and for every node there can be either 0 or 3 children, then number of leaf nodes of the tree are?

  1. A.

    (n+1)/3

  2. B.

    (2n+1)/3

  3. C.

    (n+1)/2

  4. D.

    n/2

Attempted by 337 students.

Sign up free to check your answer

Sign up free

Explore the full course: Data Structures

Loading lesson…