Skip to content
Related Articles

Related Articles

Aptitude | GATE CS 1998 | Question 46

View Discussion
Improve Article
Save Article
Like Article
  • Last Updated : 12 Oct, 2017

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
(A) x(n-1)+1
(B) xn-1
(C) xn+1
(D) x(n+1)

Answer: (A)


Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!