2013年10月11日
Unique Binary Search Trees [LEETCODE]
摘要： Givenn, how many structurally uniqueBST's(binary search trees) that store values 1...n?For example,Givenn= 3, there are a total of 5 unique BST's. 1 3 3 2 1 \ / / / \ \ 3 2 1 1 3 2 / / \ \ 2 1 ... 阅读全文
posted @ 2013-10-11 15:56 昱铭 阅读(190) 评论(0) 推荐(0)