Re: [理工] [離散]-Tree
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
推
10/18 00:32, , 1F
10/18 00:32, 1F
→
10/18 00:42, , 2F
10/18 00:42, 2F
→
10/18 00:43, , 3F
10/18 00:43, 3F
忘記打結論 XD
※ 編輯: nowar100 來自: 140.113.93.39 (10/18 00:44)
推
10/18 00:44, , 4F
10/18 00:44, 4F
→
10/18 00:45, , 5F
10/18 00:45, 5F
討論串 (同標題文章)