From 4a33ef6a04bb13ace9ab8a7551fd783815a4e0f9 Mon Sep 17 00:00:00 2001
From: X-shuffle <53906918+X-shuffle@users.noreply.github.com>
Date: Sat, 19 Jun 2021 11:33:02 +0800
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=20Golang=E7=89=88?=
 =?UTF-8?q?=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

添加 0669.修剪二叉搜索树 Golang版本
---
 problems/0669.修剪二叉搜索树.md | 26 ++++++++++++++++++++++++++
 1 file changed, 26 insertions(+)

diff --git a/problems/0669.修剪二叉搜索树.md b/problems/0669.修剪二叉搜索树.md
index 06d99b9d..2a88f195 100644
--- a/problems/0669.修剪二叉搜索树.md
+++ b/problems/0669.修剪二叉搜索树.md
@@ -286,7 +286,33 @@ class Solution:
         return root
 ```
 Go：
+```go
 
+/**
+ * Definition for a binary tree node.
+ * type TreeNode struct {
+ *     Val int
+ *     Left *TreeNode
+ *     Right *TreeNode
+ * }
+ */
+func trimBST(root *TreeNode, low int, high int) *TreeNode {
+    if root==nil{
+        return nil
+    }
+    if root.Val<low{//如果该节点值小于最小值，则该节点更换为该节点的右节点值，继续遍历
+        right:=trimBST(root.Right,low,high)
+        return right
+    }
+    if root.Val>high{//如果该节点的值大于最大值，则该节点更换为该节点的左节点值，继续遍历
+        left:=trimBST(root.Left,low,high)
+        return left
+    }
+    root.Left=trimBST(root.Left,low,high)
+    root.Right=trimBST(root.Right,low,high)
+    return root
+}
+```