From f7828e65a3ef7518d23daca6741963e0288a9cc6 Mon Sep 17 00:00:00 2001
From: jojoo15 <75017412+jojoo15@users.noreply.github.com>
Date: Fri, 21 May 2021 14:05:39 +0200
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=20python3=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
添加 0538.把二叉搜索树转换为累加树 python3版本
---
...38.把二叉搜索树转换为累加树.md | 24 ++++++++++++++++---
1 file changed, 21 insertions(+), 3 deletions(-)
diff --git a/problems/0538.把二叉搜索树转换为累加树.md b/problems/0538.把二叉搜索树转换为累加树.md
index 209c989b..cc19bb30 100644
--- a/problems/0538.把二叉搜索树转换为累加树.md
+++ b/problems/0538.把二叉搜索树转换为累加树.md
@@ -196,8 +196,26 @@ class Solution {
```
Python：
-
-
+```python3
+# Definition for a binary tree node.
+# class TreeNode:
+# def __init__(self, val=0, left=None, right=None):
+# self.val = val
+# self.left = left
+# self.right = right
+#递归法
+class Solution:
+ def convertBST(self, root: TreeNode) -> TreeNode:
+ def buildalist(root):
+ if not root: return None
+ buildalist(root.right) #右中左遍历
+ root.val += self.pre
+ self.pre = root.val
+ buildalist(root.left)
+ self.pre = 0 #记录前一个节点的数值
+ buildalist(root)
+ return root
+```
Go：
@@ -207,4 +225,4 @@ Go：
* 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)
* B站视频：[代码随想录](https://space.bilibili.com/525438321)
* 知识星球：[代码随想录](https://mp.weixin.qq.com/s/QVF6upVMSbgvZy8lHZS3CQ)
-
\ No newline at end of file
+
