From db29574063ffa7d6613a3e60ec0eab448019be61 Mon Sep 17 00:00:00 2001
From: jojoo15 <75017412+jojoo15@users.noreply.github.com>
Date: Fri, 21 May 2021 11:29:06 +0200
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200669.=E4=BF=AE=E5=89=AA?=
=?UTF-8?q?=E4=BA=8C=E5=8F=89=E6=90=9C=E7=B4=A2=E6=A0=91=20python3?=
=?UTF-8?q?=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
添加 0669.修剪二叉搜索树 python3版本
---
problems/0669.修剪二叉搜索树.md | 22 +++++++++++++++++++---
1 file changed, 19 insertions(+), 3 deletions(-)
diff --git a/problems/0669.修剪二叉搜索树.md b/problems/0669.修剪二叉搜索树.md
index 8b9e1f6d..5c839b6c 100644
--- a/problems/0669.修剪二叉搜索树.md
+++ b/problems/0669.修剪二叉搜索树.md
@@ -265,8 +265,24 @@ 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 trimBST(self, root: TreeNode, low: int, high: int) -> TreeNode:
+ if not root: return root
+ if root.val < low:
+ return self.trimBST(root.right,low,high) // 寻找符合区间[low, high]的节点
+ if root.val > high:
+ return self.trimBST(root.left,low,high) // 寻找符合区间[low, high]的节点
+ root.left = self.trimBST(root.left,low,high) // root->left接入符合条件的左孩子
+ root.right = self.trimBST(root.right,low,high) // root->right接入符合条件的右孩子
+ return root
+```
Go：
@@ -276,4 +292,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
+
