Unique Binary Search Trees II

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 return all 5 unique BST's shown below.

   1         3     3      2      1
    \       /     /      / \      \
     3     2     1      1   3      2
    /     /       \                 \
   2     1         2                 3

思路：return all， 一看就是求解NP问题。divide and conquer, 假设左右两边全部建立好了，那么再进行交叉build；对于每个i，都要进行一遍；f(i) = [1,2...i-1] as left tree, i as root, [i+1,...n] as right tree.

所以for循环中，求出左边树形结构rootnodelist，然后求出右边的树形结构rootnodelist，然后左右两边匹配。

注意node 必须每次new出来，因为每次都是新的构造，所以要用新的点；

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<TreeNode> generateTrees(int n) {
        List<TreeNode> list = new ArrayList<TreeNode>();
        if(n <= 0) {
            return list;
        }
        return dfs(1, n);
    }
    
    private List<TreeNode> dfs(int start, int end) {
        List<TreeNode> list = new ArrayList<TreeNode>();
        if(start > end) {
            list.add(null);
            return list;
        }
        for(int i = start; i <= end; i++) {
            List<TreeNode> leftlist = dfs(start, i - 1);
            List<TreeNode> rightlist = dfs(i + 1, end);
            
            for(TreeNode left: leftlist) {
                for(TreeNode right: rightlist) {
                    // 注意必须得在for loop里面建立node；
                    TreeNode node = new TreeNode(i);
                    node.left = left;
                    node.right = right;
                    list.add(node);
                }
            }
        }
        return list;
    }
}