LeetCode 1022. Sum of Root To Leaf Binary Numbers

Given a binary tree, each node has value 0 or 1. Each root-to-leaf path represents a binary number starting with the most significant bit. For example, if the path is 0 -> 1 -> 1 -> 0 -> 1, then this could represent 01101 in binary, which is 13.

For all leaves in the tree, consider the numbers represented by the path from the root to that leaf.

Return the sum of these numbers.

Example 1:
[图见leetcode]
Input: [1,0,1,0,1,0,1]
Output: 22
Explanation: (100) + (101) + (110) + (111) = 4 + 5 + 6 + 7 = 22

Note:

The number of nodes in the tree is between 1 and 1000.
node.val is 0 or 1.
The answer will not exceed 2^31 - 1.

    //when traversing, record the previous binary number, the current number is the 
    previous * 2(current is 0) or previous * 2 + 1(current is 1).
    
    public int sumRootToLeaf(TreeNode root) {
        int[] result = new int[1];
        helper(root, 0, result);
        return result[0];
    }
    public void helper(TreeNode root, int pre, int[] result) {
        if (root.left == null && root.right == null) {
            int num = root.val == 0 ? pre * 2 : pre * 2 + 1;
            result[0] = result[0] + num;
            return;
        }
        if (root.left != null) {
            if (root.val == 0) {
                helper(root.left, pre * 2, result);
            } else {
                helper(root.left, pre * 2 + 1, result);
            }
        } 
        if (root.right != null) {
            if (root.val == 0) {
                helper(root.right, pre * 2, result);
            } else {
                helper(root.right, pre * 2 + 1, result);
            }
        } 
        return;
    }