北京大学ACM比赛题目
Consider an infinite full binary search tree (see the figure below), the numbers in the nodes are 1, 2, 3, .... In a subtree whose root node is X, we can get the minimum number in this subtree by repeating going down the left node until the last level, and we can also find the ma ...
/dl/286896.html
标签：
the
Consider
infinite
numbers
上传时间：
2013-12-16
上传用户：日光微澜
