Minimum Root-to-Leaf Path Sum

Problem

Given a binary tree, find a root-to-leaf path whose sum of node values is minimum, and return the sequence of values on that path.

A leaf is a node with no left or right child. If multipl...