摘要: Given n, how many structurally unique BST's (binary search trees) that store values 1...n? 给出整数n,有多少中不同的存储着1到n的二叉搜索树。 For example, Given n = 3, there 阅读全文
posted @ 2016-07-18 17:42 ShawnChang 阅读(106) 评论(0) 推荐(0)