leetcode 257 二叉树的所有路径

  List<String> res = new LinkedList<>();
    public List<String> binaryTreePaths(TreeNode root) {
        dfs(root,"");
        return res;
    }
    void dfs(TreeNode root,String path){
        if (root != null )  {
            StringBuilder builder = new StringBuilder(path);
            builder.append(root.val);
            if (root.left == null && root.right == null){
                res.add(builder.toString());
            }else {
                builder.append("->");
                dfs(root.left,builder.toString());
                dfs(root.right,builder.toString());
            }
        }
    }