Total Answers and Comments: Last Update: March 18, 2010 Asked by: D Sridhar
Submitted by : Bharat SardaAbove answer was rated as good by the following members: itclanster
Sorting Options
Latest First
Oldest First
By Rating
September 05, 2006 01:05:09
neelimadahiya Member Since: September 2006 Contribution: 1
RE: An N-ary tree has N sub-nodes for each node, it ha... Well I have an answer with the explanation:
consider a N-ary tree with depth d
Total no of nodes in the tree T 1+N+N^2+...+N^d (1-N^(d+1))/(1-N) --(1)
No. of non leaf nodes M (1-N^d)/(1-N) ---(2)
No. of leaf nodes T-M N^d ---(3)
from eq (2) d log(base N) [MN-M+1] ---(4)
Therefore no of leaf nodes N^d MN-M+1
Is this answer useful? Yes No
September 17, 2006 00:36:19
Nav
RE: An N-ary tree has N sub-nodes for each node, it ha... Yep the answer is ((1 - N^(h-1)) / ( 1 - N)) + M
where
Example:
(h:1) (1)
(h:2) ((2)(3) (4))
(h:3) ((5) (6) (7))((8) (9) (10)) ((11) (12) (13)) (h:4) ((14) (15) (16)) ((17)) <-------- M (i.e. 4) Leaf Nodes
Here
Now Apply the formaula:
((1 - 3^(4-1)) / ( 1 - 3)) + 4
17
Solution by:
The Revolutions (Comp Sci RnD) A Orkut's Communityhttp://www.orkut.com/Community.aspx?cmm 13552733 http://www.yahoogroups.com/group/TheRevolutions
Is this answer useful? Yes No 0 1 Overall Rating: -1
Go To Top
1 
0