From ad5520612d607547f0b4d7d8e9b97719ad9db9d4 Mon Sep 17 00:00:00 2001
From: fw_qaq <82551626+Jack-Zhang-1314@users.noreply.github.com>
Date: Sun, 13 Nov 2022 23:22:47 +0800
Subject: [PATCH] =?UTF-8?q?Update=200111.=E4=BA=8C=E5=8F=89=E6=A0=91?=
 =?UTF-8?q?=E7=9A=84=E6=9C=80=E5=B0=8F=E6=B7=B1=E5=BA=A6.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0111.二叉树的最小深度.md | 37 +++++++++++------------
 1 file changed, 17 insertions(+), 20 deletions(-)

diff --git a/problems/0111.二叉树的最小深度.md b/problems/0111.二叉树的最小深度.md
index 301c84b1..074a7165 100644
--- a/problems/0111.二叉树的最小深度.md
+++ b/problems/0111.二叉树的最小深度.md
@@ -591,33 +591,30 @@ impl Solution {
     }
 
     // 迭代
-    pub fn bfs(node: Option<Rc<RefCell<TreeNode>>>) -> i32{
-        let mut min_depth = 0;
-        if node.is_none(){
-            return min_depth
+    pub fn min_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
+        let mut res = 0;
+        let mut queue = VecDeque::new();
+        if root.is_some() {
+            queue.push_back(root);
         }
-        let mut stack = vec![node.unwrap()];
-        while !stack.is_empty(){
-            min_depth += 1;
-            let num = stack.len();
-            for _i in 0..num{
-                let top = stack.remove(0);
-                let left_child = top.borrow_mut().left.take();
-                let right_child = top.borrow_mut().right.take();
-                if left_child.is_none() && right_child.is_none(){
-                    return min_depth;
+        while !queue.is_empty() {
+            res += 1;
+            for _ in 0..queue.len() {
+                let node = queue.pop_front().unwrap().unwrap();
+                if node.borrow().left.is_none() && node.borrow().right.is_none() {
+                    return res;
                 }
-                if left_child.is_some(){
-                    stack.push(left_child.unwrap());
+                if node.borrow().left.is_some() {
+                    queue.push_back(node.borrow().left.clone());
                 }
-                if right_child.is_some(){
-                    stack.push(right_child.unwrap());
+                if node.borrow().right.is_some() {
+                    queue.push_back(node.borrow().right.clone());
                 }
             }
         }
-        min_depth
+        res
     }
-
+}
 ```
 
 <p align="center">