UVA10821--Constructing BST(贪心+二分)
BST (Binary Search Tree) is an efficient data structure for searching. In a BST all the elements of the left sub-tree are smaller and those of right sub-tree are greater than the root. A typical examp
原创
2014-04-06 22:49:27 ·
847 阅读 ·
0 评论