Leetcode 508. Most Frequent Subtree Sum

Compute every node's subtree sum (sum of values in its subtree) and return the sum(s) that occur most frequently. The core challenge is performing a postorder traversal to aggregate sums, count their frequencies, and handle ties by returning all maxima.