LeetCode 257. Binary Tree Paths

最新推荐文章于 2025-01-12 23:00:00 发布

原创最新推荐文章于 2025-01-12 23:00:00 发布 · 162 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 同时被 3 个专栏收录

370 篇文章

订阅专栏

Java

263 篇文章

订阅专栏

LeetCode Tree

37 篇文章

订阅专栏

该博客讨论了如何使用前序遍历方法来找出二叉树的所有路径，并提供了具体的Java实现。博客中提到，虽然可以使用辅助函数，但其命名可能不够直观，导致递归表达式难以理解。解决方案中，当遇到叶子节点时，将当前路径添加到答案列表。在遍历过程中，分别对左子节点和右子节点进行递归操作，构建路径字符串。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

print all the paths of BT, the out put format should be: [“1->2->5”, “1->3”]

clearly, we will use the preorder, but they are not exactly the same.

I can’t think of any ways to get this problem done.

but based on the solution:
binaryTreePath(root) = searchBt(root, String path, List answer) = searchBT(root.left, path+root.val+"->", answer) searchBT((root.right, path+root.val+"->", answer) //and when it reached the end, we added the current path to our list.

class Solution {
    public List<String> binaryTreePaths(TreeNode root) {
        List<String> list = new ArrayList<>();
        if (root == null) return list;
        helper(root, list, ""); //root, 返回集合，返回集合中的子元素
        return list;
    }
    
    private void helper(TreeNode cur, List<String> list, String path) {
        if (cur.left == null && cur.right == null) {
            list.add(path + cur.val);
            return;
        }
            
        if (cur.left != null) helper(cur.left, list, path + cur.val + "->");
        if (cur.right != null) helper(cur.right, list, path + cur.val + "->");
    }
    
    
}