作者bernachom (Terry)
看板Grad-ProbAsk
标题[理工] [离散]-Tree
时间Sun Oct 18 00:22:08 2009
不知道怎麽表示..
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: 61.224.203.230
1F：→ nowar100:有 10/18 00:24