From 9b2f1700ca45604662b4e10bd2769b5026d3b1f9 Mon Sep 17 00:00:00 2001
From: fw_qaq <82551626+Jack-Zhang-1314@users.noreply.github.com>
Date: Tue, 15 Nov 2022 22:45:20 +0800
Subject: [PATCH] =?UTF-8?q?Update=200257.=E4=BA=8C=E5=8F=89=E6=A0=91?=
 =?UTF-8?q?=E7=9A=84=E6=89=80=E6=9C=89=E8=B7=AF=E5=BE=84.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0257.二叉树的所有路径.md | 28 +++++++++++++++++++++++
 1 file changed, 28 insertions(+)

diff --git a/problems/0257.二叉树的所有路径.md b/problems/0257.二叉树的所有路径.md
index 297acb60..0fb7ed0d 100644
--- a/problems/0257.二叉树的所有路径.md
+++ b/problems/0257.二叉树的所有路径.md
@@ -794,6 +794,34 @@ object Solution {
   }
 }
 ```
+	
+rust:
+
+```rust
+use std::cell::RefCell;
+use std::rc::Rc;
+impl Solution {
+    pub fn binary_tree_paths(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<String> {
+        let mut res = vec![];
+        Self::recur(&root, String::from(""), &mut res);
+        res
+    }
+    pub fn recur(node: &Option<Rc<RefCell<TreeNode>>>, mut path: String, res: &mut Vec<String>) {
+        let r = node.as_ref().unwrap().borrow();
+        path += format!("{}", r.val).as_str();
+        if r.left.is_none() && r.right.is_none() {
+            res.push(path.to_string());
+            return;
+        }
+        if r.left.is_some() {
+            Self::recur(&r.left, path.clone() + "->", res);
+        }
+        if r.right.is_some() {
+            Self::recur(&r.right, path + "->", res);
+        }
+    }
+}
+```
 
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">