【无标题】

最新推荐文章于 2024-07-12 18:12:33 发布

C++萌新大佬别嫌弃

最新推荐文章于 2024-07-12 18:12:33 发布

阅读量79

点赞数

文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/qq_40205417/article/details/126621338

版权

最大二叉树II

https://leetcode.cn/problems/maximum-binary-tree-ii/

/**
 * 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* cur = root; // 当前节点
        TreeNode* pre = nullptr; // 记录前一个节点
        while (cur) {
            if (val > cur->val) {
                if (!pre) {
                    return new TreeNode(val, root, nullptr);
                } 
                TreeNode* node = new TreeNode(val, cur, nullptr);
                pre->right = node;
                return root;
            } else {
                pre = cur;
                cur = cur->right;
            }
        }
        pre->right = new TreeNode(val);
        return root;
    }
};