Distribute Coins In Binary Tree With Minimum Moves Required
DFS traversal in binary tree redistributes coins to minimize moves: calculate excess coins at each node and accumulate required moves for optimal solution.
979. Distribute Coins in Binary Tree Difficulty: Medium Topics: Tree, Depth-First Search, Binary Tree You are given the root of a binary tree with n nodes where each node in the tree has node.val coins. There are n coins in total throughout the whole tree. In one move, we may choose two adjacent nodes and move one coin from one node to another. A move may be from parent to child, or from child to parent. Return the minimum number of moves required to make every node have exactly one coin. Example 1: Input: root = [3,0,0] Output: 2 Explanation: From the root of the tree, we move one coin to i...