Min Root-to-Leaf Path Sum of N-ary Tree

Problem Given the root of an N-ary tree, determine the smallest sum among all paths that begin at the root and end at a leaf. Return that minimum sum. Each node may have any number of children. A leaf is a node whose children collection is empty, and a path sum includes every node value encountered from the root through that leaf. The tree is serialized in level order. A null entry marks the end of the child list for the current parent and separates that group from the next…