Unique Binary Search Trees I II

Given n, how many structurally unique BST's (binary search trees) that store values 1 ... n?

Example:

Input: 3
Output: 5
Explanation:
Given n = 3, there are a total of 5 unique BST's:

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

 

解法：卡塔兰数。

class Solution {
    public int numTrees(int n) {
        int[] res = new int[n+1];
        if(n == 0)return 0;
        res[0] = 1;
        res[1] = 1;
        for(int i=2;i<=n;i++){
            for(int j=0;j<i;j++){
                res[i] += res[j]*res[i-1-j];
            }
        }
        return res[n];
    }
}

 

 

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 {
    
public List<TreeNode> generateTrees(int n) {
    List<TreeNode> re = new ArrayList<TreeNode>();
    if(n == 0)return re;
    return helper(1,n);
}
private List<TreeNode> helper(int left, int right){
    List<TreeNode> res = new ArrayList<TreeNode>();
    if(left>right)
    {
        res.add(null);
        return res;
    }
    for(int i=left;i<=right;i++)
    {
        List<TreeNode> leftList = helper(left,i-1);
        List<TreeNode> rightList = helper(i+1,right);
        for(int j=0;j<leftList.size();j++)
        {
            for(int k=0;k<rightList.size();k++)
            {
                TreeNode root = new TreeNode(i);
                root.left = leftList.get(j);
                root.right = rightList.get(k);
                res.add(root);
            }
        }
    }
    return res;
    }
}