LeetCode——Unique Binary Search Trees II

Given an integer n, generate all structurally unique BST’s (binary search trees) that store values 1 … n.
Example:
Input: 3
Output:
[
[1,null,3,2],
[3,2,null,1],
[3,1,null,null,2],
[2,1,3],
[1,null,2,null,3]
]
Explanation:
The above output corresponds to the 5 unique BST’s shown below:

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

解法

用递归先分别建立左右子树再与根节点组合起来

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    List<TreeNode> generateTrees(int n) {
        if(n<1)
        	return new ArrayList<TreeNode>();
		return core(1,n);
    }

	private List<TreeNode> core(int start, int end) {
		// TODO Auto-generated method stub
		List<TreeNode> res =new ArrayList<TreeNode>();
		if(start>end){
			res.add(null);
			return res;
		}
		for(int i=start;i<=end;i++)
		{
			List<TreeNode> left=core(start,i-1);
			List<TreeNode> right=core(i+1,end);
			for(TreeNode l:left){
				for(TreeNode r:right){
					TreeNode root=new TreeNode(i);
					root.left=l;
					root.right=r;
					res.add(root);
				}
			}
		}
		return res;
	}
}

Runtime: 2 ms, faster than 67.15% of Java online submissions for Unique Binary Search Trees II.
Memory Usage: 37.5 MB, less than 97.45% of Java online submissions for Unique Binary Search Trees II.