Unique Binary Search Trees II

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         3     3      2      1
    \       /     /      / \      \
     3     2     1      1   3      2
    /     /       \                 \
   2     1         2                 3

题意：将1...n的二叉搜索树全部求出

解法：使用递归实现，思路参考：http://blog.csdn.net/fightforyourdream/article/details/17345795

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; left = null; right = null; }
 * }
 */
public class Solution {
    
    
    public ArrayList<TreeNode> dfs(int s, int end){
        ArrayList<TreeNode> list = new ArrayList<TreeNode>();
        if(s > end){
            list.add(null);
            return list;
        }
        
        for(int i=s; i<=end; i++){
            ArrayList<TreeNode> left = dfs(s, i-1);
            ArrayList<TreeNode> right = dfs(i+1, end);
            
            for(int j=0; j<left.size(); j++){
                for(int k=0; k<right.size(); k++){
                    TreeNode root = new TreeNode(i+1);
                    root.left = left.get(j);
                    root.right = right.get(k);
                    list.add(root);
                }
            }
        }
        return list;
    }
    
    public ArrayList<TreeNode> generateTrees(int n) {
        return dfs(0, n-1);
    }
}