[商管] [資結]-中央97-資管(丙組)
題目：Let B(n) be the number of distinct binary trees
constructed from n nodes.
For examples,B(0)=1,B(1)=1,B(2)=2,B(3)=5.
Please write a recursive formula to define B(n)
based on a combination of B(i) where 0<=i<n.
雖然#19myFflD這篇文章有版友問過一樣的問題
推文有給答案
但我自己是覺得推文給錯的答案
因為B(4)=14,代入推文的公式是算不出來的
而且代那個公式應該跟recursive沒關係吧
畢竟我記得公式長這樣B(n)= 1 ╭2n╮
───│ │
n + 1 ╰ n╯
解很久想不出 recursive formula
不知道有沒有人想出來或有答案的
感謝:)
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 111.248.224.250
推
02/26 06:41, , 1F
02/26 06:41, 1F
→
02/26 06:41, , 2F
02/26 06:41, 2F
→
02/26 06:43, , 3F
02/26 06:43, 3F
→
02/26 06:44, , 4F
02/26 06:44, 4F
→
02/26 06:45, , 5F
02/26 06:45, 5F
→
02/26 06:45, , 6F
02/26 06:45, 6F
→
02/26 06:46, , 7F
02/26 06:46, 7F
→
02/26 06:46, , 8F
02/26 06:46, 8F
※ 編輯: iamhebe 來自: 111.248.204.168 (02/26 09:26)
推
02/26 10:22, , 9F
02/26 10:22, 9F
→
02/26 10:56, , 10F
02/26 10:56, 10F
→
02/26 11:12, , 11F
02/26 11:12, 11F
→
02/26 11:12, , 12F
02/26 11:12, 12F
→
02/26 11:58, , 13F
02/26 11:58, 13F
推
02/26 16:24, , 14F
02/26 16:24, 14F
→
09/11 14:19, , 15F
09/11 14:19, 15F