綠的傢俱

[DS] 93清大計算機科學(數字搜尋數) >※ 引述 之銘言： >when we do tree search for a set of very long keys, the cost of a key comparison is very high. How much can we reduce the number of key comparison by using a digital search tree such as a Patricia tree(Practical algorithm to retrieve information in alphanumeric)? > ANS: 寫出digital search tree 的原理即可2006/02/03 洪逸家族 .msgcontent .wsharing ul li { text-indent: 0; } 分享 Facebook Plurk YAHOO! .