→ rnf0:有K+1片葉子的樹,會有K個inner nodes, 所以是K+1 01/26 13:21
→ rnf0:上面這句對full binary tree成立 01/26 13:22
1.
(2)A single comparison between two elements can distiguish up to 2
permutations.How many permutations can be distinguished using
k comparisons?
請問要怎麼想?目前只想到decision tree的高度減一是最多比較次數.
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 1.174.139.227