Binary Tree Tilt
Easy
Topics
The tilt of a node is the absolute difference between the sum of all values in its left subtree and the sum of all values in its right subtree (an empty subtree sums to 0). Return the sum of every node’s tilt.
Example 1
Input: root = [1,2,3] Output: 1
Example 2
Input: root = [4,2,9,3,5,null,7] Output: 15
Constraints
- 0 <= number of nodes <= 10^4
- -1000 <= Node.val <= 1000
Run ⌘' · Submit ⌘⏎
SensAI