257. Binary Tree Paths*

最新推荐文章于 2021-12-30 10:05:52 发布

Yingying_code

最新推荐文章于 2021-12-30 10:05:52 发布

阅读量220

点赞数

分类专栏： leetcode Java Tree

本文链接：https://blog.csdn.net/alwaystry/article/details/53790196

版权

leetcode 同时被 3 个专栏收录

261 篇文章 0 订阅

订阅专栏

Java

188 篇文章 0 订阅

订阅专栏

Tree

26 篇文章 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"]

public List<String> binaryTreePaths(TreeNode root) {
    List<String> answer = new ArrayList<String>();
    if (root != null) searchBT(root, "", answer);
    return answer;
}
private void searchBT(TreeNode root, String path, List<String> answer) {
    if (root.left == null && root.right == null) answer.add(path + root.val);
    if (root.left != null) searchBT(root.left, path + root.val + "->", answer);
    if (root.right != null) searchBT(root.right, path + root.val + "->", answer);
}

总结：递归