GoLang Solution For LeetCode Problem: Binary Tree Tilt
Solving Binary Tree Tilt in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Input: 1 / \ 2 3 Output: 1 Explanation: Tilt of node 2 : 0 Tilt of node 3 : 0 Tilt of node 1 : |2-3| = 1 Tilt of binary tree : 0 + 0 + 1 = 1
- The sum of node values in any subtree won't exceed the range of 32-bit integer.
- All the tilt values won't exceed the range of 32-bit integer.
See the full details of the problem Binary Tree Tilt at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go