From 79623eba4afb9700fed82d3b0a6d44fa7870e98e Mon Sep 17 00:00:00 2001
From: Arthur <gpan20020205@gmail.com>
Date: Tue, 26 Oct 2021 15:59:35 +0100
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200538.=E6=8A=8A=E4=BA=8C?=
 =?UTF-8?q?=E5=8F=89=E6=90=9C=E7=B4=A2=E6=A0=91=E8=BD=AC=E6=8D=A2=E4=B8=BA?=
 =?UTF-8?q?=E7=B4=AF=E5=8A=A0=E6=A0=91.md=20C=E8=AF=AD=E8=A8=80?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...38.把二叉搜索树转换为累加树.md | 21 +++++++++++++++++++
 1 file changed, 21 insertions(+)

diff --git a/problems/0538.把二叉搜索树转换为累加树.md b/problems/0538.把二叉搜索树转换为累加树.md
index 6de98c6f..16b00817 100644
--- a/problems/0538.把二叉搜索树转换为累加树.md
+++ b/problems/0538.把二叉搜索树转换为累加树.md
@@ -293,6 +293,27 @@ var convertBST = function (root) {
 };
 ```
 
+##C
+
+递归
+```c
+int pre;
+void traversal(struct TreeNode* node) {
+    if(!node)
+        return ;
+    traversal(node->right);
+    node->val = node->val + pre;
+    pre = node->val;
+    traversal(node->left);
+}
+
+struct TreeNode* convertBST(struct TreeNode* root){
+    pre = 0;
+    traversal(root);
+    return root;
+}
+```
+
 -----------------------
 * 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)
 * B站视频：[代码随想录](https://space.bilibili.com/525438321)