Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.Problem Constraints
An example is the root-to-leaf path 1->2->3 which represents the number 123.
Find the total sum of all root-to-leaf numbers % 1003.
0 <= Node.val <= 9Input Format
The first argument is TreeNode A, pointing to the root of the tree.Output Format
Return an integer equal to the total sum of all root-to-leaf numbers % 1003.Example Input
The root-to-leaf path 1->2 represents the number 12.
The root-to-leaf path 1->3 represents the number 13.
Return the sum = (12 + 13) % 1003 = 25 % 1003 = 25.
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified.
Still have a question? Checkout Sample Codes for more details.