LeetCode538.把二叉搜索树转换为累加树
class Solution {
public:int sum = 0; TreeNode* convertBST(TreeNode* root) { if (root){convertBST(root->right);sum += root->val;root->val = sum;convertBST(root->left);}return root;}};
class Solution {
public:int sum = 0; TreeNode* convertBST(TreeNode* root) { if (root){convertBST(root->right);sum += root->val;root->val = sum;convertBST(root->left);}return root;}};