Skip to content
Related Articles

Related Articles

GATE | GATE-CS-2002 | Question 34

Improve Article
Save Article
  • Last Updated : 28 Jun, 2021
Improve Article
Save Article

The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or 3 children is:
(A) n/2
(B) (n – 1)/3
(C) (n – 1)/2
(D) (2n + 1)/3


Answer: (D)

Explanation: See https://www.geeksforgeeks.org/data-structures-binary-trees-question-17/

Quiz of this Question

My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!