We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent c5a9ead commit 79623ebCopy full SHA for 79623eb
problems/0538.把二叉搜索树转换为累加树.md
@@ -293,6 +293,27 @@ var convertBST = function (root) {
293
};
294
```
295
296
+##C
297
+
298
+递归
299
+```c
300
+int pre;
301
+void traversal(struct TreeNode* node) {
302
+ if(!node)
303
+ return ;
304
+ traversal(node->right);
305
+ node->val = node->val + pre;
306
+ pre = node->val;
307
+ traversal(node->left);
308
+}
309
310
+struct TreeNode* convertBST(struct TreeNode* root){
311
+ pre = 0;
312
+ traversal(root);
313
+ return root;
314
315
+```
316
317
-----------------------
318
* 作者微信:[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)
319
* B站视频:[代码随想录](https://space.bilibili.com/525438321)
0 commit comments