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
递归,straightforward。
/**
* 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 *> generateTrees(int n) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
return generateTree(1,n);
}
vector<TreeNode*> generateTree(int begin,int end)
{
vector<TreeNode*> result;
if(begin>end)
{
result.push_back(NULL);
return result;
}
for(int i = begin;i<=end;i++)
{
vector<TreeNode*> leftTree = generateTree(begin,i-1);
vector<TreeNode*> rightTree = generateTree(i+1,end);
for(int j = 0;j<leftTree.size();j++)
{
for(int k =0;k<rightTree.size();k++)
{
TreeNode* current = new TreeNode(i);
current->left = leftTree[j];
current->right = rightTree[k];
result.push_back(current);
}
}
}
}
};