From 46e1d0b907030592f6480b5cf04588b319bcab67 Mon Sep 17 00:00:00 2001
From: fw_qaq <82551626+Jack-Zhang-1314@users.noreply.github.com>
Date: Sun, 13 Nov 2022 23:29:12 +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 | 1 +
 1 file changed, 1 insertion(+)

diff --git a/problems/0111.二叉树的最小深度.md b/problems/0111.二叉树的最小深度.md
index 074a7165..0b2ec0f6 100644
--- a/problems/0111.二叉树的最小深度.md
+++ b/problems/0111.二叉树的最小深度.md
@@ -591,6 +591,7 @@ impl Solution {
     }
 
     // 迭代
+    // 需要 use std::collections::VecDeque;
     pub fn min_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
         let mut res = 0;
         let mut queue = VecDeque::new();