Minimum Sum Root-to-Leaf Path

Problem Statement

Minimum Sum Root-to-Leaf Path Problem Description You are given the root of a nonempty binary tree whose nodes contain signed integers. Return the values along a root-to-leaf path whose node-value sum is minimum. A leaf is a node with no left child and no right child. A root-to-leaf path starts at the root, follows child links downward, and ends at a leaf. If several root-to-leaf paths share the same minimum sum, return the first one encountered by a depth-first traversal that explores each node's left child before its right child. Return the selected path as a sequence of node values ordered from the root to the leaf. Function Complete the function `minimumSumRootToLeafPath` in the editor. The starter already reads stdin and builds the tree. You only implement the function. `minimumSumRootToLeafPath` has the following parameters: `left`: `left[i]` is the index of node `i`'s left child, or `-1` if none `right`: `right[i]` is the index of node `i`'s right child, or `-1` if none `va