题目大意:用数字1~n构建出所有可能的二叉搜索树
分析:dfs。和上道题类似,但是不用动规了,因为这道题要构建出具体的树,所以递归即可求解。以i为根,左子树由1~i-1构成,右子树由i+1~n构成,递归过程就是以范围内的每个数字做根,分别生成左右子树,然后将生成的所有左右子树组合起来与根成树后压入答案。
代码:转载自https://blog.csdn.net/feliciafay/article/details/18204217
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
//34ms
class Solution {
public:
vector<TreeNode*> generateTreesHelper(int start, int end ) {
if (start > end) return vector<TreeNode*> {NULL}; //start>end时返回空树(注意是一颗空树而不是直接返回NULL)
vector<TreeNode*> final;
for (int i = start; i <= end; ++i) { //start=end时,会生成两个空子树,此时left和right的size都是1
vector<TreeNode*> left = generateTreesHelper(start, i - 1); //生成左子树
vector<TreeNode*> right = generateTreesHelper(i + 1, end); //生成右子树
for (int j = 0; j < left.size(); ++j) { //交叉组合不同的左子树与右子树
for (int k = 0; k < right.size(); ++k) {
TreeNode* root = new TreeNode(i); //以i为根
root->left = left[j]; //组合第j个左子树
root->right = right[k]; //组合第k个右子树
final.push_back(root); //压入当前层答案中
}
}
}
return final;
}
vector<TreeNode *> generateTrees(int n) {
if(n == 0) return {};
return generateTreesHelper(1, n);
}
};