Leetcode Problem 129. Sum Root to Leaf Numbers

129. Sum Root to Leaf Numbers

Leetcode Solutions

Define a helper function that takes a node and the current number formed.
If the node is null, return 0.
Update the current number by shifting it one place to the left and adding the node's value.
If the node is a leaf, return the current number.
Recursively call the helper function for the left and right children, adding their results together, and return this sum.
Call the helper function with the root node and 0 as the initial current number.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen