問題詳情

【題組】(3) Given a binomial tree Bt, show that there are exactly C(k, 1) nodes at depth i, where C(k, )denotes a combination function.

參考答案