🌴 Day 8

Author: AkashRajpurohit

README.md

@@ -14,7 +14,7 @@
 7. [Add Two Numbers II](https://leetcode.com/explore/challenge/card/november-leetcoding-challenge/564/week-1-november-1st-november-7th/3521/) ➡️ [CPP Solution](Week1/addTwoNumbers.cpp)
 
 ## Week 2 🚧
-Coming soon...
+1. [Binary Tree Tilt](https://leetcode.com/explore/challenge/card/november-leetcoding-challenge/565/week-2-november-8th-november-14th/3524/) ➡️ [CPP Solution](Week2/findTilt.cpp)
 
 ## Week 3 🚧
 Coming soon...

Week2/findTilt.cpp

@@ -0,0 +1,30 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+class Solution {
+private:
+    int tilt(TreeNode* root, int& result) {
+        if(root == NULL) return 0;
+        
+        int left = tilt(root->left, result);
+        int right = tilt(root->right, result);
+        
+        result += abs(left - right);
+        
+        return left + right + root->val;
+    }
+public:
+    int findTilt(TreeNode* root) {
+        int result = 0;
+        tilt(root, result);
+        return result;
+    }
+};