Leetcode Problem 563. Binary Tree Tilt
Leetcode Solutions
Post-Order Depth-First Search (DFS) to Calculate Tilt
- Define a recursive function
calculateTiltAndSum(node)that returns a tuple containing the tilt of the current node and the sum of values in the subtree rooted at the current node. - If the current node is
null, return (0, 0) as the tilt and sum. - Recursively call
calculateTiltAndSum(node.left)to get the left tilt and left sum. - Recursively call
calculateTiltAndSum(node.right)to get the right tilt and right sum. - Calculate the current node's tilt as the absolute difference between the left sum and the right sum.
- Calculate the sum of the current subtree as the sum of the current node's value, the left sum, and the right sum.
- Add the current node's tilt to the total tilt.
- Return the current node's tilt and the sum of the current subtree.
- Call
calculateTiltAndSum(root)and return the total tilt.
Iterative In-Order Traversal with Tilt Calculation
Ask Question
Programming Language
Purpose:
image/screenshot of info(optional)
Full Screen
Loading...
Suggested Answer
Answer
Full Screen
Copy Answer Code
Loading...