From 145114872d6d43e6f3e938891249bf52c7aea8c2 Mon Sep 17 00:00:00 2001
From: fw_qaq <82551626+Jack-Zhang-1314@users.noreply.github.com>
Date: Sun, 20 Nov 2022 16:58:25 +0800
Subject: [PATCH] =?UTF-8?q?Update=200513.=E6=89=BE=E6=A0=91=E5=B7=A6?=
 =?UTF-8?q?=E4=B8=8B=E8=A7=92=E7=9A=84=E5=80=BC.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0513.找树左下角的值.md | 34 ++++++++++++++++++++++++++
 1 file changed, 34 insertions(+)

diff --git a/problems/0513.找树左下角的值.md b/problems/0513.找树左下角的值.md
index fd6e5d95..cfb4a6c4 100644
--- a/problems/0513.找树左下角的值.md
+++ b/problems/0513.找树左下角的值.md
@@ -587,6 +587,40 @@ object Solution {
   }
 ```
 
+### rust
+
+**层序遍历**
+
+```rust
+use std::cell::RefCell;
+use std::collections::VecDeque;
+use std::rc::Rc;
+impl Solution {
+    pub fn find_bottom_left_value(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
+        let mut queue = VecDeque::new();
+        let mut res = 0;
+        if root.is_some() {
+            queue.push_back(root);
+        }
+        while !queue.is_empty() {
+            for i in 0..queue.len() {
+                let node = queue.pop_front().unwrap().unwrap();
+                if i == 1 {
+                    res = node.borrow().val;
+                }
+                if node.borrow().left.is_some() {
+                    queue.push_back(node.borrow().left.clone());
+                }
+                if node.borrow().right.is_some() {
+                    queue.push_back(node.borrow().right.clone());
+                }
+            }
+        }
+        res
+    }
+}
+```
+
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
   <img src="../pics/网站星球宣传海报.jpg" width="1000"/>