力扣538. 把二叉搜索树转换为累加树 问题求解答

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

求大神看下代码为什么错了 孩子真是没搞明白

题目

给出二叉 搜索 树的根节点，该树的节点值各不相同，请你将其转换为累加树（Greater Sum Tree），使每个节点 node 的新值等于原树中大于或等于 node.val 的值之和。

提醒一下，二叉搜索树满足下列约束条件：

节点的左子树仅包含键 小于 节点键的节点。
节点的右子树仅包含键 大于 节点键的节点。
左右子树也必须是二叉搜索树。

示例1：

示例2：

输入：[4,1,6,0,2,5,7,null,null,null,3,null,null,null,8]
输出：[30,36,21,36,35,26,15,null,null,null,33,null,null,null,8]

示例3：

输入：root = [1,0,2]
输出：[3,3,2]

示例4：

输入：root = [3,2,4,1]
输出：[7,9,4,10]

提示：

树中的节点数介于 0 和 104 之间。
每个节点的值介于 -104 和 104 之间。
树中的所有值 互不相同 。
给定的树为二叉搜索树。

struct TreeNode *dfs(struct TreeNode *root,int *sum){
     if(root!=NULL){
         dfs(root->right,&sum);
         (*sum)+=root->val;
         root->val = *sum;
         dfs(root->left,&sum);
     }
     return root;
 }

struct TreeNode* convertBST(struct TreeNode* root){
    int sum =0;

    dfs(root,&sum);
    return root;
}

错误提示：

=================================================================
21ERROR: AddressSanitizer: stack-buffer-overflow on address 0x7ffd4a8921e8 at pc 0x55f0a51e1b0d bp 0x7ffd4a892080 sp
0x7ffd4a892070 READ of size 4 at 0x7ffd4a8921e8 thread T0
#1 0x7f4c51d9f082 in __libc_start_main (/lib/x86_64-linux-gnu/libc.so.6+0x24082) Address 0x7ffd4a8921e8 is
located in stack of thread T0 at offset 200 in frame This frame has
35 object(s):
[48, 52) ‘sum’ (line 15)
[64, 72) ‘nbytes’ (line 28)
[96, 104) ‘line’ (line 30)
[128, 136) ‘sum’ (line 22)
[160, 168) ‘sum’ (line 22)
[192, 200) ‘sum’ (line 22) <== Memory access at offset 200 overflows this variable
[224, 232) ‘sum’ (line 22)
[256, 264) ‘sum’ (line 22)
[288, 296) ‘sum’ (line 22)
[320, 328) ‘sum’ (line 22)
[352, 360) ‘sum’ (line 22)
[384, 392) ‘sum’ (line 22)
[416, 424) ‘sum’ (line 22)
[448, 456) ‘sum’ (line 22)
[480, 488) ‘sum’ (line 22)
[512, 520) ‘sum’ (line 22)
[544, 552) ‘sum’ (line 22)
[576, 584) ‘sum’ (line 22)
[608, 616) ‘sum’ (line 22)
[640, 648) ‘sum’ (line 22)
[672, 680) ‘sum’ (line 22)
[704, 712) ‘sum’ (line 22)
[736, 744) ‘sum’ (line 22)
[768, 776) ‘sum’ (line 22)
[800, 808) ‘sum’ (line 22)
[832, 840) ‘sum’ (line 22)
[864, 872) ‘sum’ (line 22)
[896, 904) ‘sum’ (line 22)
[928, 936) ‘sum’ (line 22)
[960, 968) ‘sum’ (line 22)
[992, 1000) ‘sum’ (line 22)
[1024, 1032) ‘sum’ (line 22)
[1056, 1064) ‘sum’ (line 22)
[1088, 1096) ‘sum’ (line 22)
[1120, 1124) ‘SEPARATOR’ (line 23) HINT: this may be a false positive if your program uses some custom stack unwind mechanism,
swapcontext or vfork
(longjmp and C++ exceptions are supported) Shadow bytes around the buggy address: 0x10002950a3e0: 00 00 00 00 00 00 00 00 00 00 00
00 00 00 00 00 0x10002950a3f0: 00 00 00 00 00 00 00 00 00 00 00 00
00 00 00 00 0x10002950a400: 00 00 00 00 00 00 00 00 00 00 00 00 00
00 00 00 0x10002950a410: 00 00 00 00 00 00 00 00 00 00 00 00 00 00
00 00 0x10002950a420: 00 00 00 00 f1 f1 f1 f1 f1 f1 04 f2 00 f2 f2
f2
=>0x10002950a430: 00 f2 f2 f2 00 f2 f2 f2 00 f2 f2 f2 00[f2]f2 f2 0x10002950a440: 00 f2 f2 f2 00 f2 f2 f2 00 f2 f2 f2 00 f2 f2 f2
0x10002950a450: 00 f2 f2 f2 00 f2 f2 f2 00 f2 f2 f2 00 f2 f2 f2
0x10002950a460: 00 f2 f2 f2 00 f2 f2 f2 00 f2 f2 f2 00 f2 f2 f2
0x10002950a470: 00 f2 f2 f2 00 f2 f2 f2 00 f2 f2 f2 00 f2 f2 f2
0x10002950a480: 00 f2 f2 f2 00 f2 f2 f2 00 f2 f2 f2 00 f2 f2 f2 Shadow
byte legend (one shadow byte represents 8 application bytes):
Addressable: 00 Partially addressable: 01 02 03 04 05 06
07 Heap left redzone: fa Freed heap region: fd
Stack left redzone: f1 Stack mid redzone: f2 Stack
right redzone: f3 Stack after return: f5 Stack use after
scope: f8 Global redzone: f9 Global init order:
f6 Poisoned by user: f7 Container overflow: fc Array
cookie: ac Intra object redzone: bb ASan internal:
fe Left alloca redzone: ca Right alloca redzone: cb
Shadow gap: cc
21ABORTING