Leetcode 979. Distribute Coins in Binary Tree

Given a binary tree where total coins equals the number of nodes, compute the minimum number of parent-child moves needed so every node has exactly one coin; this is solved by a bottom-up traversal that computes subtree surplus/deficit and sums the absolute transfers across edges.