Leetcode Problem 979. Distribute Coins in Binary Tree
Leetcode Solutions
Depth First Search to Balance Coins in a Binary Tree
- Define a recursive DFS function that calculates the excess coins for a node.
- For each node, calculate the excess coins for its left and right children recursively.
- The number of moves for a node is the absolute value of the sum of excess coins from its left and right children.
- Update the total number of moves by adding the number of moves for the current node.
- Return the excess coins for the current node to its parent.
Ask Question
Programming Language
Purpose:
image/screenshot of info(optional)
Full Screen
Loading...
Suggested Answer
Answer
Full Screen
Copy Answer Code
Loading...