Leetcode 3157. Find the Level of Tree with Minimum Sum

Given a binary tree, compute the sum of node values at each depth and return the level index that has the minimum sum (if multiple levels tie, return the smallest index). This requires aggregating level sums efficiently—commonly via level-order traversal or depth-indexed accumulation.