From 3f7beb8c8f3d9e06f9932a157ffce92dd7d2aade Mon Sep 17 00:00:00 2001
From: fw_qaq <82551626+Jack-Zhang-1314@users.noreply.github.com>
Date: Sun, 4 Dec 2022 17:59:09 +0800
Subject: [PATCH 1/2] =?UTF-8?q?Update=200235.=E4=BA=8C=E5=8F=89=E6=90=9C?=
 =?UTF-8?q?=E7=B4=A2=E6=A0=91=E7=9A=84=E6=9C=80=E8=BF=91=E5=85=AC=E5=85=B1?=
 =?UTF-8?q?=E7=A5=96=E5=85=88.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...35.二叉搜索树的最近公共祖先.md | 33 +++++++++++++++++++
 1 file changed, 33 insertions(+)

diff --git a/problems/0235.二叉搜索树的最近公共祖先.md b/problems/0235.二叉搜索树的最近公共祖先.md
index c90b3d8c..97f85437 100644
--- a/problems/0235.二叉搜索树的最近公共祖先.md
+++ b/problems/0235.二叉搜索树的最近公共祖先.md
@@ -418,6 +418,39 @@ object Solution {
 }
 ```
 
+## rust
+
+```rust
+impl Solution {
+    pub fn lowest_common_ancestor(
+        root: Option<Rc<RefCell<TreeNode>>>,
+        p: Option<Rc<RefCell<TreeNode>>>,
+        q: Option<Rc<RefCell<TreeNode>>>,
+    ) -> Option<Rc<RefCell<TreeNode>>> {
+        let q_val = q.as_ref().unwrap().borrow().val;
+        let p_val = p.as_ref().unwrap().borrow().val;
+        let root_val = root.as_ref().unwrap().borrow().val;
+
+        if root_val > q_val && root_val > p_val {
+            return Self::lowest_common_ancestor(
+                root.as_ref().unwrap().borrow().left.clone(),
+                p,
+                q,
+            );
+        };
+
+        if root_val < q_val && root_val < p_val {
+            return Self::lowest_common_ancestor(
+                root.as_ref().unwrap().borrow().right.clone(),
+                p,
+                q,
+            );
+        }
+        root
+    }
+}
+```
+
 
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">

From 6866f2b9ace6a92d38d9b28f3e91365a38878c35 Mon Sep 17 00:00:00 2001
From: fw_qaq <82551626+Jack-Zhang-1314@users.noreply.github.com>
Date: Sun, 4 Dec 2022 19:35:20 +0800
Subject: [PATCH 2/2] =?UTF-8?q?Update=200235.=E4=BA=8C=E5=8F=89=E6=90=9C?=
 =?UTF-8?q?=E7=B4=A2=E6=A0=91=E7=9A=84=E6=9C=80=E8=BF=91=E5=85=AC=E5=85=B1?=
 =?UTF-8?q?=E7=A5=96=E5=85=88.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...35.二叉搜索树的最近公共祖先.md | 28 +++++++++++++++++++
 1 file changed, 28 insertions(+)

diff --git a/problems/0235.二叉搜索树的最近公共祖先.md b/problems/0235.二叉搜索树的最近公共祖先.md
index 97f85437..aa06e86c 100644
--- a/problems/0235.二叉搜索树的最近公共祖先.md
+++ b/problems/0235.二叉搜索树的最近公共祖先.md
@@ -420,6 +420,8 @@ object Solution {
 
 ## rust
 
+递归：
+
 ```rust
 impl Solution {
     pub fn lowest_common_ancestor(
@@ -451,6 +453,32 @@ impl Solution {
 }
 ```
 
+迭代：
+
+```rust
+impl Solution {
+    pub fn lowest_common_ancestor(
+        mut root: Option<Rc<RefCell<TreeNode>>>,
+        p: Option<Rc<RefCell<TreeNode>>>,
+        q: Option<Rc<RefCell<TreeNode>>>,
+    ) -> Option<Rc<RefCell<TreeNode>>> {
+        let p_val = p.unwrap().borrow().val;
+        let q_val = q.unwrap().borrow().val;
+        while let Some(node) = root.clone() {
+            let root_val = node.borrow().val;
+            if root_val > q_val && root_val > p_val {
+                root = node.borrow().left.clone();
+            } else if root_val < q_val && root_val < p_val {
+                root = node.borrow().right.clone();
+            } else {
+                return root;
+            }
+        }
+        None
+    }
+}
+```
+
 
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">