95. Unique Binary Search Trees II Medium

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.

思路：题目要求给出所有的二叉查找树情况。对于一个根，其二叉树的左枝是比它小的点的任意组合，右枝是比他大的点的任意组合。左右两面分别作为子问题得到子二叉树，连接到根上得到想要的结果。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
 void help(vector<TreeNode*>&result, int start, int end) {
     if (start > end) {
         result.push_back(NULL);
     }
     if (start == end) {
         TreeNode *temp = new TreeNode(start);
         result.push_back(temp);
         return;
     }
     for (int i = start; i <= end; i++) {
         vector<TreeNode*> left;
         vector<TreeNode*> right;
         help(left, start, i - 1);
         help(right, i + 1, end);
         for (int j = 0; j < left.size(); j++) {
             for (int k = 0; k < right.size(); k++) {
                 TreeNode* temp = new TreeNode(i);
                 temp -> left = left[j];
                 temp -> right = right[k];
                 result.push_back(temp);
             }
         }
     }
 }
 
 
class Solution {
public:
    vector<TreeNode*> generateTrees(int n) {
        vector<TreeNode*> result;
        if (n == 0) {
            return result;
        }
        help(result, 1, n);
        return result;
    }
};