@@ -0,0 +1,669 @@
+/**%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  public List%3CString%3E binaryTreePaths(TreeNode root) %7B%0A    List%3CString%3E lst = new ArrayList%3CString%3E();%0A    if (root == null) %7B%0A      return lst;%0A    %7D else if (root.left == null && root.right == null) %7B%0A      lst.add(%22%22 + root.val);%0A    %7D else %7B%0A      lst.addAll(binaryTreePaths(root.left));%0A      lst.addAll(binaryTreePaths(root.right));%0A      for (int i = 0; i %3C lst.size(); i++) %7B%0A        lst.set(i, root.val + %22-%3E%22 + lst.get(i));%0A      %7D%0A    %7D%0A    return lst;%0A  %7D%0A%7D%0A

add bt paths