Question

You are given an N-ary tree where each node has a value and a list of children. Return the 1-indexed level that contains the most nodes. If multiple levels have the same maximum count, return the smallest level number. Return 0 if the tree is empty. ...