# [leetcode-95]Unique Binary Search Trees II(c++)

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.

/**
* 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*> genearateTree(int start, int end) {
vector<TreeNode*> res;
vector<TreeNode*> tmpVec;
TreeNode *cur;
if (start > end) {
res.push_back(NULL);
return res;
}
for (int i = start; i <= end; i++) {
vector<TreeNode*> left = genearateTree(start, i-1);
vector<TreeNode*> right = genearateTree(i + 1, end);
for (int j1 = 0; j1 < left.size(); j1++) {
for (int j2 = 0; j2 < right.size(); j2++) {
TreeNode* cur = new TreeNode(i);
cur->left = left[j1];
cur->right = right[j2];
res.push_back(cur);
}
}
}
return res;
}
vector<TreeNode*> generateTrees(int n) {
return genearateTree(1,n);
}
};

• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120