@@ -0,0 +1,862 @@
+/**%0A * Problem: https://leetcode.com/problems/binary-tree-paths/%0A * %0A * Definition for a binary tree node.%0A * public class TreeNode %7B%0A *     int val;%0A *     TreeNode left;%0A *     TreeNode right;%0A *     TreeNode(int x) %7B val = x; %7D%0A * %7D%0A */%0Apublic class Solution %7B%0A    private List%3CString%3E list;%0A    public List%3CString%3E binaryTreePaths(TreeNode root) %7B%0A        list = new ArrayList%3CString%3E();%0A        if(root == null) return list;%0A        traverse(root, %22%22);%0A        return list;%0A    %7D%0A    %0A    private void traverse(TreeNode root, String s) %7B%0A        s += %22-%3E%22 + root.val;%0A        if(root.left == null && root.right == null) %7B%0A            list.add(s.substring(2));%0A            return;%0A        %7D %0A        if(root.left != null) %7B%0A            traverse(root.left, s);%0A        %7D%0A        if(root.right != null) %7B%0A            traverse(root.right, s);%0A        %7D%0A    %7D%0A%7D%0A

Create Binary_Tree_Paths.java