题目:
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
/**
* 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*> generateTrees(int n) {
return generateTreesCore(1, n);
}
private:
vector<TreeNode*> generateTreesCore(int start, int end){
vector<TreeNode *> res;
if(start >= end){
TreeNode *root = NULL;
if (start == end) root = new TreeNode(start);//只有一个节点
res.push_back(root);
return res;
}
for (int i = start; i <= end; ++i){
vector<TreeNode *> leftChild = generateTreesCore(start, i - 1);
vector<TreeNode *> rightChild = generateTreesCore(i + 1, end);
if (leftChild.empty()){//左子树为空
for (int j = 0; j < rightChild.size(); ++j){
TreeNode *root = new TreeNode(i);//对每一种子树形式都要创建一个根节点
root->right = rightChild[j];
res.push_back(root);
}
}
else if (rightChild.empty()){//右子树为空
for (int j = 0; j < leftChild.size(); ++j){
TreeNode *root = new TreeNode(i);//对每一种子树形式都要创建一个根节点
root->left = leftChild[j];
res.push_back(root);
}
}
else{//左右子树都不为空
for (int j = 0; j < leftChild.size(); ++j){
for (int k = 0; k < rightChild.size(); ++k){
TreeNode *root = new TreeNode(i);//对每一种子树形式都要创建一个根节点
root->left = leftChild[j];
root->right = rightChild[k];
res.push_back(root);
}
}
}
}
return res;
}
};