題組內容

6. [Advanced Data Structures:

(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.