257. Binary Tree Paths

最新推荐文章于 2020-02-26 21:39:14 发布

jianingkid

最新推荐文章于 2020-02-26 21:39:14 发布

阅读量131

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/jianingkid/article/details/52204820

版权

leetcode 专栏收录该内容

96 篇文章 0 订阅

订阅专栏

Given a binary tree, return all root-to-leaf paths.

For example, given the following binary tree:

All root-to-leaf paths are:

["1->2->5", "1->3"]

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<String> binaryTreePaths(TreeNode root) {
        List<String> path=new ArrayList<>();
        if(root!=null)binaryTP(root,"",path);
        return path;
    }
    public void binaryTP(TreeNode root,String paths,List<String> path) {
        if(root.right==null&&root.left==null) path.add(paths+root.val);
        if(root.left!=null){
            binaryTP(root.left,paths+root.val+"->",path);
        }
        if(root.right!=null){
            binaryTP(root.right,paths+root.val+"->",path);
        }
    }
}