leetcode Unique Binary Search Trees II java
题目: Given n, generate all structurally unique BST's (binary search trees) that store values 1...n.For example,Given n = 3, your program should return all 5 unique BST's shown below. 1
原创
2015-05-11 15:10:05 ·
477 阅读 ·
0 评论