2016年8月27日
ITA 15.5 Optimal binary search trees
摘要： p400 页最后一段 When j >= i , we need to select a root kr from among ki ... kj and then make an optimal binary search tree with keys ki ... kr-1 as its lef 阅读全文
posted @ 2016-08-27 13:11 PatrickZhou 阅读(184) 评论(0) 推荐(0) 编辑