Unique Binary Search Trees II

Description
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~n，那么根节点就有n种可能性，选定了根节点之后，这棵树的左子树节点的编号和右子树节点的编号也就确定了，它的左子树节点的编号都小于跟节点，右子树节点的编号都大于根节点，所以只要构造出所有的左子树和所有的右子树，在构造出来的左子树和右子树中，任意一棵左子树都能够搭配任意一棵右子树，所以二叉搜索树的数目为左子树的数目乘以右子树的数目。构造左子树和右子树相当于一个递归的过程。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<TreeNode *> genTrees(vector<int> & val) {
        int v_size = val.size();
        vector<TreeNode *> result;
        if (v_size == 0){
            result.push_back(NULL);
            return result;
        }

        for (int j = 0; j < v_size; j++) {
            vector<int> l_count;
            vector<int> r_count;
            for (int k = 0; k < v_size; k++) {
                if (val[k] < val[j])
                    l_count.push_back(val[k]);//挑选出可构成左子树节点的编号
                if (val[k] > val[j])
                    r_count.push_back(val[k]);//挑选出可构成右子树节点的编号
            }

            vector<TreeNode *> l_sub = genTrees(l_count); //返回所有左子树根节点的数组
            vector<TreeNode *> r_sub = genTrees(r_count);//返回所有右子树根节点的数组

            for (int m = 0; m < l_sub.size(); m++) {
                for (int n = 0; n < r_sub.size(); n++) {
                    TreeNode * temp = new TreeNode(val[j]);
                    temp -> left = l_sub[m];
                    temp -> right = r_sub[n];
                    result.push_back(temp);
                }
            }
        }

        return result;
    }

    vector<TreeNode*> generateTrees(int n) {
        if (n == 0)
            return vector<TreeNode *>();
        vector<int> val;
        for (int i = 0; i < n; i++)
            val.push_back(i + 1);
        return genTrees(val);
    }
};