题目:998. 最大二叉树 II
思路:DFS
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
TreeNode* insertIntoMaxTree(TreeNode* root, int val) {
TreeNode* res = dfs(root, val);
return res;
}
TreeNode* dfs(TreeNode* root, int val){
if(root == nullptr) return new TreeNode(val);
if(val > root->val){
TreeNode* temp = new TreeNode(val, root, nullptr);
return temp;
}else{
TreeNode* temp = dfs(root->right, val);
root->right = temp;
return root;
}
}
};