Branch Sums in a Binary Tree

Branch Sums

Given a binary tree, compute the sum of all the branches in the tree. 1 branch is the path from the root to a leaf.

Example

Consider the binary tree

            [1]
          /     \
       [2]       [3]

Solution

Output: [3, 4]

Explanation

Left branch sum = [1]-[2] = 3
Right branch sum = [1]-[3] = 4
Output: [3, 4]

Constraints

The number of nodes in the tree is in the range [0, 5000].
-1000 <= BinaryTree.value <= 1000

Stuck? Check out hints

Try creating a helper function that takes into account a Global Sums array and a Running Sum variable to keep into account the summations of values

Check if the node you're currently at is a leaf node or node. Can it help you reaching the base case?

Uploaded by: Manu Arora

Share this problem on

#tree #Recursion #Amazon #Directi