2014年3月24日
[LeetCode] Unique Binary Search Trees II
摘要： Givenn, generate all structurally uniqueBST's(binary search trees) that store values 1...n.For example,Givenn= 3, your program should return all 5 unique BST's shown below. 1 3 3 2 1 \ / / / \ \ 3 2 1 1 3 2 / / \ ... 阅读全文
posted @ 2014-03-24 09:41 xchangcheng 阅读(162) 评论(0) 推荐(0)