力扣刷题记录62.1-----538. 把二叉搜索树转换为累加树

---

一、题目

二、代码

/**
 * 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:
    //对于二叉搜索树  中序遍历 就是从小到大的有序数组
     void recursion(TreeNode* process_node ,vector<int>&  all_nums)
     {

        
        if(process_node->left)   recursion(process_node->left,all_nums);
        
        //这一部分是处理代码
   
        all_nums.push_back(process_node->val);
         
        if(process_node->right)  recursion(process_node->right,all_nums);

     }

      void another_recursion(TreeNode* process_node ,vector<int>&  sum_vector)
     {

        
        if(process_node->left)   another_recursion(process_node->left,sum_vector);
        
        //这一部分是处理代码
   
        process_node->val=sum_vector[0];
        sum_vector.erase(sum_vector.begin());
         
        if(process_node->right)  another_recursion(process_node->right,sum_vector);
        
     }

     
    TreeNode* convertBST(TreeNode* root)
    {
         int i,j;
         vector<int> all_nums;
         vector<int> sum_vector;     
         int sum=0;
         
         if(root!=nullptr)
         {
             
             recursion(root,all_nums);
             for(i=0;i<all_nums.size();i++)  std::cout<<"   "<<all_nums[i];
             std::cout<<std::endl;
             for(i=0;i<all_nums.size();i++) sum+=all_nums[i];
             std::cout<<" sum  "<<sum   <<std::endl;
             
             for(i=0;i<all_nums.size();i++)  
             {
               sum_vector.push_back(sum);
               sum-=all_nums[i];
             }

             for(i=0;i<sum_vector.size();i++)  std::cout<<"   "<<sum_vector[i];
             std::cout<<std::endl;
              
             another_recursion(root,sum_vector);
 

         } 

         
         
         
         return root;
    } 
};
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80

三、运行结果