Unique Binary Search Trees II
Unique Binary Search Trees II@(leetcode)[枚举, DFS]Given an integer n, generate all structurally unique BST’s (binary search trees) that store values 1…n.For example,
Given n = 3, your program should re
原创
2016-08-21 15:54:36 ·
931 阅读 ·
0 评论