Binary Tree Tilt, is a LeetCode problem. In this post we will see how we can solve this challenge in Python

Problem Description

Given a binary tree, return the tilt of the whole tree.

The tilt of a tree node is defined as the absolute difference between the sum of all left subtree node values and the sum of all right subtree node values. Null node has tilt 0.

The tilt of the whole tree is defined as the sum of all nodes' tilt.

Example:

Input: 1 / 2 3 Output: 1 Explanation: Tilt of node 2 ....

You can find the full details of the problem Binary Tree Tilt at LeetCode

Solution: Please check the main.py snippet for the solution.

This solution originally posted at: Github by @kamyu104