Skip to content
Related Articles
Open in App
Not now

Related Articles

Data Structures | Binary Trees | Question 8

Improve Article
Save Article
  • Difficulty Level : Medium
  • Last Updated : 10 Jul, 2018
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: Let L be the number of leaf nodes and I be the number of internal nodes, then following relation holds for above given tree (For details, please see question 3 of this post)

  L = (3-1)I + 1 = 2I + 1

Total number of nodes(n) is sum of leaf nodes and internal nodes

  n = L + I

After solving above two, we get L = (2n+1)/3

Quiz of this Question

My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!