Update 0111.二叉树的最小深度.md

2025-07-09 19:44:45 +08:00 · 2022-11-13 23:29:12 +08:00
parent ad5520612d
commit 46e1d0b907
1 changed files with 1 additions and 0 deletions
--- 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();