LeetCode-Unique Binary Search Trees II

Given 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

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

OJ's Binary Tree Serialization:

The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.

Here's an example:

   1
  / \
 2   3
    /
   4
    \
     5

The above binary tree is serialized as "{1,2,3,#,#,4,#,#,5}".

Solution:

Code:

<span style="font-size:14px;">/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<TreeNode *> helper(int begin, int end) {
        vector<TreeNode *> results;
        if (begin > end) {
            results.push_back(NULL);
            return results;
        }
        for (int i = begin; i <= end; i++) {
            vector<TreeNode *> leftV = helper(begin, i-1);
            vector<TreeNode *> rightV = helper(i+1, end);
            for (int j = 0; j < leftV.size(); j++) {
                for (int k = 0; k < rightV.size(); k++) {
                    TreeNode *root = new TreeNode(i);
                    root->left = leftV[j];
                    root->right = rightV[k];
                    results.push_back(root);
                }
            }
        }
        return results;
    }
    
    vector<TreeNode *> generateTrees(int n) {
        return helper(1, n);
    }
};</span>