diff --git a/src/main/java/leetcode/editor/cn/BinaryTreePaths.java b/src/main/java/leetcode/editor/cn/BinaryTreePaths.java
new file mode 100644
index 0000000..554b857
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/BinaryTreePaths.java
@@ -0,0 +1,65 @@
+//给定一个二叉树，返回所有从根节点到叶子节点的路径。 
+//
+// 说明: 叶子节点是指没有子节点的节点。 
+//
+// 示例: 
+//
+// 输入:
+//
+//   1
+// /   \
+//2     3
+// \
+//  5
+//
+//输出: ["1->2->5", "1->3"]
+//
+//解释: 所有根节点到叶子节点的路径为: 1->2->5, 1->3 
+// Related Topics 树 深度优先搜索 字符串 二叉树 
+// 👍 540 👎 0
+
+package leetcode.editor.cn;
+
+import com.code.leet.entiy.TreeNode;
+
+import java.util.ArrayList;
+import java.util.List;
+
+//257:二叉树的所有路径
+public class BinaryTreePaths{
+    public static void main(String[] args) {
+        //测试代码
+        Solution solution = new BinaryTreePaths().new Solution();
+    }
+    //力扣代码
+    //leetcode submit region begin(Prohibit modification and deletion)
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode() {}
+ *     TreeNode(int val) { this.val = val; }
+ *     TreeNode(int val, TreeNode left, TreeNode right) {
+ *         this.val = val;
+ *         this.left = left;
+ *         this.right = right;
+ *     }
+ * }
+ */
+class Solution {
+    public List<String> binaryTreePaths(TreeNode root) {
+        if(root==null){
+            return null;
+        }
+        List<String> list = new ArrayList<>();
+        if(root.left!=null){}
+
+
+        return list;
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+}
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/BinaryTreePaths.md b/src/main/java/leetcode/editor/cn/BinaryTreePaths.md
new file mode 100644
index 0000000..b6e7ebb
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/BinaryTreePaths.md
@@ -0,0 +1,18 @@
+<p>给定一个二叉树，返回所有从根节点到叶子节点的路径。</p>
+
+<p><strong>说明:</strong>&nbsp;叶子节点是指没有子节点的节点。</p>
+
+<p><strong>示例:</strong></p>
+
+<pre><strong>输入:</strong>
+
+   1
+ /   \
+2     3
+ \
+  5
+
+<strong>输出:</strong> [&quot;1-&gt;2-&gt;5&quot;, &quot;1-&gt;3&quot;]
+
+<strong>解释:</strong> 所有根节点到叶子节点的路径为: 1-&gt;2-&gt;5, 1-&gt;3</pre>
+<div><div>Related Topics</div><div><li>树</li><li>深度优先搜索</li><li>字符串</li><li>二叉树</li></div></div>\n<div><li>👍 540</li><li>👎 0</li></div>
\ No newline at end of file