# 979. Distribute Coins in Binary Tree

You are given the `root` of a binary tree with `n` nodes where each `node` in the tree has `node.val` coins and there are `n` coins total.

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 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 its left child, and one coin to its right child.
``````

Example 2:

``````Input: root = [0,3,0]
Output: 3
Explanation: From the left child of the root, we move two coins to the root [taking two moves].  Then, we move one coin from the root of the tree to the right child.
``````

Example 3:

``````Input: root = [1,0,2]
Output: 2
``````

Example 4:

``````Input: root = [1,0,0,null,3]
Output: 4
``````

Constraints:

• The number of nodes in the tree is `n`.
• `1 <= n <= 100`
• `0 <= Node.val <= n`
• The sum of `Node.val` is `n`.

``````class Solution {
public:
int distributeCoins(TreeNode* root) {
int res = 0;
helper(root, res);
return res;
}
int helper(TreeNode* node, int& res) {
if (!node) return 0;
int left = helper(node->left, res), right = helper(node->right, res);
res += abs(left) + abs(right);
return node->val + left + right - 1;
}
};
``````

Github 同步地址:

https://github.com/grandyang/leetcode/issues/979

Sum of Distances in Tree

Binary Tree Cameras

https://leetcode.com/problems/distribute-coins-in-binary-tree/

https://leetcode.com/problems/distribute-coins-in-binary-tree/discuss/221930/JavaC%2B%2BPython-Recursive-Solution

https://leetcode.com/problems/distribute-coins-in-binary-tree/discuss/221939/C%2B%2B-with-picture-post-order-traversal

LeetCode All in One 题目讲解汇总(持续更新中…)

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation