From 08199d56b5c99f3a23150b99a0cdfd4812fcdeb5 Mon Sep 17 00:00:00 2001
From: Wen <wenslife@outlook.com>
Date: Sat, 18 Sep 2021 22:18:30 +0800
Subject: [PATCH] =?UTF-8?q?=E6=96=B0=E5=A2=9E=200235.=E4=BA=8C=E5=8F=89?=
 =?UTF-8?q?=E6=90=9C=E7=B4=A2=E6=A0=91=E7=9A=84=E6=9C=80=E8=BF=91=E5=85=AC?=
 =?UTF-8?q?=E5=85=B1=E7=A5=96=E5=85=88.md=20Python3=E8=BF=AD=E4=BB=A3?=
 =?UTF-8?q?=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../0235.二叉搜索树的最近公共祖先.md    | 13 ++++++++++++-
 1 file changed, 12 insertions(+), 1 deletion(-)

diff --git a/problems/0235.二叉搜索树的最近公共祖先.md b/problems/0235.二叉搜索树的最近公共祖先.md
index 7fad5af0..c9ef95dd 100644
--- a/problems/0235.二叉搜索树的最近公共祖先.md
+++ b/problems/0235.二叉搜索树的最近公共祖先.md
@@ -268,11 +268,22 @@ class Solution:
         if root.val < p.val and root.val < q.val:
             return self.lowestCommonAncestor(root.right, p, q)
         return root
- 
 ```
 
 迭代法：
+```python
+class Solution:
+    """二叉搜索树的最近公共祖先 迭代法"""
 
+    def lowestCommonAncestor(self, root: 'TreeNode', p: 'TreeNode', q: 'TreeNode') -> 'TreeNode':
+        while True:
+            if root.val > p.val and root.val > q.val:
+                root = root.left
+            elif root.val < p.val and root.val < q.val:
+                root = root.right
+            else:
+                return root
+```
 
 ## Go