【LeetCode】C# 95、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

给定n，返回所有BST 。
思路：一个动态规划的问题，不断地在n个数字中找根，后在跟的左右树中在进行这一循环。遍历出所有的可能性。

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

    public static List<TreeNode> UniqueBinarySearchTreeIIHelper(int start, int end)
    {
        List<TreeNode> res = new List<TreeNode>();
        if(start > end)
        { 
            res.Add(null);
            return res;
        }
        List<TreeNode> leftChild, rightChild;

        for(int i=start; i<=end; i++)
        {
            leftChild = UniqueBinarySearchTreeIIHelper(start,i-1);
            rightChild = UniqueBinarySearchTreeIIHelper(i+1,end);

            foreach (var litem in leftChild)
            {
                foreach (var ritem in rightChild)
                {
                    TreeNode root = new TreeNode(i);
                    root.left = litem;
                    root.right = ritem;
                    res.Add(root);
                }
            }
        }
        return res;
    }
}