Aptitude | GATE CS 1998 | Question 46

Last Updated :

Discuss

Comments

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

x(n-1)+1

xn-1

xn+1

x(n+1)

This question is part of this quiz :

Top MCQs on Tree Traversal with Interview Question and Answers | DSA Quiz,GATE CS 1998

Tags:

Share your thoughts in the comments

author

GeeksforGeeks