Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Amount of Time for Binary Tree to Be Infected
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Average of Levels in Binary Tree
Coding
- Balance a Binary Search Tree
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 979. Distribute Coins in Binary Tree
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source