Distribute Coins In Binary Tree | LeetCode
Problem Source Given binary tree with N nodes, in which each node value represents the number of coins in that node. It is guaranteed that there are N coins in total. In one move, you can choose to transport one coin from parent to a children or vice versa. Find the minimum number of moves …
