solves binary tree tilt

Author: anishLearnsToCode

README.md

@@ -148,7 +148,7 @@
 | 557 | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii) | Easy | [![Java](assets/java.png)](src/ReverseWordsInStringIII.java) [![Python](assets/python.png)](python/reverse_words_in_string_iii.py) |
 | 559 | [Maximum Depth of N-Ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree) | Easy | [![Java](assets/java.png)](src/MaximumDepthOfNAryTree.java) [![Python](assets/python.png)](python/maximum_depth_of_n_ary_tree.py) |
 | 561 | [Array Partition I](https://leetcode.com/problems/array-partition-i) | Easy | [![Java](assets/java.png)](src/ArrayPartitionI.java) [![Python](assets/python.png)](python/array_partiton_I.py) |
-| 563 | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt) | Easy | |
+| 563 | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt) | Easy | [![Java](assets/java.png)](src/BinaryTreeTilt.java) [![Python](assets/python.png)](python/binary_tree_tilt.py) |
 | 566 | [Reshape The Matrix](https://leetcode.com/problems/reshape-the-matrix) | Easy | |
 | 572 | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree) | Easy | |
 | 575 | [Distribute Candies](https://leetcode.com/problems/distribute-candies) | Easy | |

python/binary_tree_tilt.py

@@ -0,0 +1,21 @@
+# Definition for a binary tree node.
+class TreeNode:
+    def __init__(self, val=0, left=None, right=None):
+        self.val = val
+        self.left = left
+        self.right = right
+
+
+class Solution:
+    def __init__(self):
+        self.sumTilts = 0
+
+    def computeTilts(self, root: TreeNode) -> int:
+        if root is None: return 0
+        leftSum, rightSum = self.computeTilts(root.left), self.computeTilts(root.right)
+        self.sumTilts += abs(leftSum - rightSum)
+        return leftSum + rightSum + root.val
+
+    def findTilt(self, root: TreeNode) -> int:
+        self.computeTilts(root)
+        return self.sumTilts

src/BinaryTreeTilt.java

@@ -0,0 +1,16 @@
+public class BinaryTreeTilt {
+    public int sumTilts = 0;
+
+    public int findTilt(TreeNode root) {
+        computeTilt(root);
+        return sumTilts;
+    }
+
+    private int computeTilt(TreeNode root) {
+        if (root == null) return 0;
+        int leftSum = computeTilt(root.left);
+        int rightSum = computeTilt(root.right);
+        sumTilts += Math.abs(leftSum - rightSum);
+        return leftSum + rightSum + root.val;
+    }
+}