⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 full n-ary tree has m non-leaf nodes.txt

📁 It is an ebook about trees
💻 TXT
字号:
 full N-ary tree has M non-leaf nodes, how many leaf nodes does it have? 

Discuss it!          


Use Geometric progression. 


M + (N ^ (n-1)) = (1 - (N ^ n)) / (1 - N) 

Here (N ^ (n-1)) is the number of leaf-nodes. 

Solving for this leads to the answer 

Leaf nodes = M * (N - 1) + 1 



Suppose you have a 3-ary tree 


                A 
      B         C         D 
   E  F  G   H  I  J   K  L  M 



So, here M=4 and N=3. So using the formula above, 


Leaf nodes = M * (N - 1) + 1 = 4 * (3 - 1) + 1 = 9 
 

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -