题目:
给定一个整数 n,生成所有由 1 ... n 为节点所组成的二叉搜索树。
示例:
输入: 3
输出:
[
[1,null,3,2],
[3,2,null,1],
[3,1,null,null,2],
[2,1,3],
[1,null,2,null,3]
]
解释:
以上的输出对应以下 5 种不同结构的二叉搜索树:
1 3 3 2 1
\ / / / \ \
3 2 1 1 3 2
/ / \ \
2 1 2 3
思路:
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) {
val = x;
}
}
class Solution {
public List<TreeNode> generateTrees(int n) {
if (n == 0) {
return new LinkedList<TreeNode>();
}
return generate_trees(1, n);
}
public LinkedList<TreeNode> generate_trees(int start, int end) {
LinkedList<TreeNode> alltrees = new LinkedList<TreeNode>();
//循环结束条件
//[start,end]
if (start > end) {
alltrees.add(null);
return alltrees;
}
//选择一个根 pick up a root
for (int i = start; i <= end; i++) {
LinkedList<TreeNode> left_trees = generate_trees(start, i - 1);
LinkedList<TreeNode> right_trees = generate_trees(i + 1, end);
//拼接这些个二叉树
for (TreeNode l : left_trees) {
for (TreeNode r : right_trees) {
TreeNode currentTree = new TreeNode(i);
currentTree.left = l;
currentTree.right = r;
alltrees.add(currentTree);
}
}
}
return alltrees;
}
}