要求:rt
思路:把大于等于该节点的和赋给该节点,即把右子树加上来,反向中序遍历即可
/**
* 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:
int sum=0;
void dfs(TreeNode* root){
if(!root)return;
convertBST(root->right);
sum+=root->val;
root->val=sum;
convertBST(root->left);
}
TreeNode* convertBST(TreeNode* root) {
dfs(root);
return root;
}
};