作者nowar100 (抛砖引玉)
看板Grad-ProbAsk
标题Re: [理工] [离散]-Tree
时间Sun Oct 18 00:28:47 2009
internal:i external: j
总共节点数 n = i+j = 2i + 1 (分支度是2，root没有分支接他，所以要+1)
=> j = i+1
=> n = 2i+1
※ 引述《bernachom (Terry)》之铭言：
: 不知道怎麽表示..
: A full rooted binary tree is a rooted tree with the property that every
: internal vertex hax exactly two children. How many vertices does a full
: rooted binary tree have if it has i internal vertices?
: 请教一下
: internal vertices有包含root吗?
: 谢谢
--
※ 发信站: 批踢踢实业坊(ptt.cc)
◆ From: 140.113.93.39
1F：推 bernachom:那(2^K)-1呢? 我是在想说有什麽不一样.. 10/18 00:32
2F：→ nowar100:K是什麽? 10/18 00:42
3F：→ nowar100:是degree吧 他题目只给你i吧 10/18 00:43
忘记打结论 XD
※ 编辑: nowar100 来自: 140.113.93.39 (10/18 00:44)
4F：推 bernachom:树的高度 10/18 00:44
5F：→ bernachom:我以为可以用己知的条件..这样我就知道了，谢谢^^ 10/18 00:45