首页 > itarticle > [leetcode] problem 257 – binary tree paths

[leetcode] problem 257 – binary tree paths

admin 11月 13, 2020 0

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

Note

A leaf is a node with no children.

Example

Input:

Output: [“1->2->5”, “1->3”]

Explanation: All root-to-leaf paths are: 1->2->5, 1->3

Code

public class  {
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode(int x) { val = x; }
}

public List<String> binaryTreePaths(TreeNode root) {
    List<String> result = new ArrayList<>();

    if (root == null)
        return result;

    StringBuilder sb = new StringBuilder();
    helper(result, root, sb.append(root.val));
    return result;
}

private void helper(List<String> result, TreeNode root, StringBuilder sb) {
    if (root.left == null && root.right == null) {
        result.add(sb.toString());
        return;
    }

    int length = sb.length();

    if (root.left != null) {
        helper(result, root.left, sb.append("->").append(root.left.val));
        sb.setLength(length);
    }
    
    if (root.right != null) {
        helper(result, root.right, sb.append("->").append(root.right.val));
        sb.setLength(length);
    }
}