[理工] [離散]-Tree

[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: 61.224.203.230
→ nowar100:有