From 1e40f295a9906df7b5c4308cb1fe733e73bf02b4 Mon Sep 17 00:00:00 2001
From: fw_qaq <82551626+Jack-Zhang-1314@users.noreply.github.com>
Date: Mon, 7 Nov 2022 17:24:44 +0800
Subject: [PATCH 1/2] =?UTF-8?q?update=20=E4=BA=8C=E5=8F=89=E6=A0=91?=
 =?UTF-8?q?=E7=9A=84=E7=BB=9F=E4=B8=80=E8=BF=AD=E4=BB=A3=E6=B3=95.md=20abo?=
 =?UTF-8?q?ut=20rust?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/二叉树的统一迭代法.md | 77 +++++++++++++++++++++++++
 1 file changed, 77 insertions(+)

diff --git a/problems/二叉树的统一迭代法.md b/problems/二叉树的统一迭代法.md
index 030d3ae1..6e768ec7 100644
--- a/problems/二叉树的统一迭代法.md
+++ b/problems/二叉树的统一迭代法.md
@@ -666,6 +666,83 @@ object Solution {
   }
 }
 ```
+
+rust:
+
+```rust
+impl Solution{
+    // 前序
+    pub fn preorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
+        let mut res = vec![];
+        let mut stack = vec![];
+        if root.is_some(){
+            stack.push(root);
+        }
+        while !stack.is_empty(){
+            if let Some(node) = stack.pop().unwrap(){
+                if node.borrow().right.is_some(){
+                    stack.push(node.borrow().right.clone());
+                }
+                if node.borrow().left.is_some(){
+                    stack.push(node.borrow().left.clone());
+                }
+                stack.push(Some(node));
+                stack.push(None);
+            }else{
+                res.push(stack.pop().unwrap().unwrap().borrow().val);
+            }
+        }
+        res
+    }
+    // 中序
+        pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
+        let mut res = vec![];
+        let mut stack = vec![];
+        if root.is_some() {
+            stack.push(root);
+        }
+        while !stack.is_empty() {
+            if let Some(node) = stack.pop().unwrap() {
+                if node.borrow().right.is_some() {
+                    stack.push(node.borrow().right.clone());
+                }
+                stack.push(Some(node.clone()));
+                stack.push(None);
+                if node.borrow().left.is_some() {
+                    stack.push(node.borrow().left.clone());
+                }
+            } else {
+                res.push(stack.pop().unwrap().unwrap().borrow().val);
+            }
+        }
+        res
+    }
+    // 后序
+    pub fn postorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
+        let mut res = vec![];
+        let mut stack = vec![];
+        if root.is_some() {
+            stack.push(root);
+        }
+        while !stack.is_empty() {
+            if let Some(node) = stack.pop().unwrap() {
+                stack.push(Some(node.clone()));
+                stack.push(None);
+                if node.borrow().right.is_some() {
+                    stack.push(node.borrow().right.clone());
+                }
+                if node.borrow().left.is_some() {
+                    stack.push(node.borrow().left.clone());
+                }
+            } else {
+                res.push(stack.pop().unwrap().unwrap().borrow().val);
+            }
+        }
+        res
+    }
+}
+```
+
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
   <img src="../pics/网站星球宣传海报.jpg" width="1000"/>

From fe46bb43d2272c656c0744b88081b72487276798 Mon Sep 17 00:00:00 2001
From: fw_qaq <82551626+Jack-Zhang-1314@users.noreply.github.com>
Date: Tue, 8 Nov 2022 12:51:43 +0800
Subject: [PATCH 2/2] =?UTF-8?q?Update=20=E4=BA=8C=E5=8F=89=E6=A0=91?=
 =?UTF-8?q?=E7=9A=84=E7=BB=9F=E4=B8=80=E8=BF=AD=E4=BB=A3=E6=B3=95.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/二叉树的统一迭代法.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/problems/二叉树的统一迭代法.md b/problems/二叉树的统一迭代法.md
index 6e768ec7..69c23e5c 100644
--- a/problems/二叉树的统一迭代法.md
+++ b/problems/二叉树的统一迭代法.md
@@ -695,7 +695,7 @@ impl Solution{
         res
     }
     // 中序
-        pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
+    pub fn inorder_traversal(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
         let mut res = vec![];
         let mut stack = vec![];
         if root.is_some() {