Leetcode 1273. Delete Tree Nodes

Given a rooted tree (via a parent array) and values for each node, remove all subtrees whose total node-sum equals zero (deletions cascade) and return the count of remaining nodes; the core challenge is computing subtree sums with a postorder DFS and pruning based on those sums.