Leetcode 1973. Count Nodes Equal to Sum of Descendants

Given a binary tree, count how many nodes have a value equal to the sum of all values in their descendant nodes (i.e., the subtree sum excluding the node itself). This typically requires computing subtree sums (postorder DFS) and comparing each node’s value to its descendants’ total.