LeetCode-树-中序遍历(DFS)-所有大于等于节点的值之和

1 题目

剑指 Offer II 054. 所有大于等于节点的值之和

538. 把二叉搜索树转换为累加树

1038. 把二叉搜索树转换为累加树

2 代码实现

/**
 * 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* convertBST(TreeNode* root) {
        deque<TreeNode*> q;
        dfs(root, q);
        int sum = 0;
        TreeNode* tmp = NULL;
        while(!q.empty())
        {
            tmp = q.back();
            q.pop_back();
            sum += tmp->val;
            tmp->val = sum;
        }

        return root;
    }

    void dfs(TreeNode* root, deque<TreeNode*>& q)
    {
        if (!root)
            return;
        
        dfs(root->left, q);
        q.push_back(root);
        dfs(root->right, q);
    }
};