You are given the root of a binary tree where each node has a 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. The answer is guaranteed to fit in a 32-bits integer.
Example 1:
Input: root = [1,0,1,0,1,0,1]
Output: 22
Explanation: (100) + (101) + (110) + (111) = 4 + 5 + 6 + 7 = 22
Example 2:
Input: root = [0]
Output: 0
Example 3:
Input: root = [1]
Output: 1
Example 4:
Input: root = [1,1]
Output: 3
Constraints:
The number of nodes in the tree is in the range [1, 1000].
Node.val is 0 or 1.
/**
* Definition for a binary tree node.
* public class TreeNode {
* public int val;
* public TreeNode left;
* public TreeNode right;
* public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
public class Solution {
int ans = 0;
public int SumRootToLeaf(TreeNode root) {
Helper(root,0);
return ans;
}
private void Helper(TreeNode root,int sum){
if(root==null){
return;
}
int currVal = sum*2+root.val;
if(root.left==null && root.right==null){
ans+=currVal;
}
if(root.left!=null){
Helper(root.left,currVal);
}
if(root.right!=null){
Helper(root.right,currVal);
}
}
}
Time Complexity: O(n)
Space Complexity: O(height)