Leetcode-5050 Binary Search Tree to Greater Sum Tree(从二叉搜索树到更大和树)

 1 class Solution
 2 {
 3     public:
 4         int rnt = 0;
 5         TreeNode* bstToGst(TreeNode* root)
 6         {
 7             if(!root)
 8                 return NULL;
 9             bstToGst(root->right);
10             int tmp = root->val;
11             root->val += rnt;
12             rnt += tmp;
13             bstToGst(root->left);
14             return root;
15         }
16 };