0563 solved.

liuyubobobo · liuyubobobo · commit 97df423f6847 · 2019-02-23T15:52:24.000-08:00
diff --git a/0563-Binary-Tree-Tilt/cpp-0563/CMakeLists.txt b/0563-Binary-Tree-Tilt/cpp-0563/CMakeLists.txt
@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.13)
+project(cpp_0563)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(cpp_0563 main2.cpp)
diff --git a/0563-Binary-Tree-Tilt/cpp-0563/main.cpp b/0563-Binary-Tree-Tilt/cpp-0563/main.cpp
@@ -0,0 +1,44 @@
+/// Source : https://leetcode.com/problems/binary-tree-tilt/
+/// Author : liuyubobobo
+/// Time   : 2019-02-23
+
+#include <iostream>
+
+using namespace std;
+
+
+/// Recursive Simulation
+/// Time Complexity: O(n^2)
+/// Space Complexity: O(h)
+
+/// Definition for a binary tree node.
+struct TreeNode {
+    int val;
+    TreeNode *left;
+    TreeNode *right;
+    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+};
+
+
+class Solution {
+
+public:
+    int findTilt(TreeNode* root) {
+
+        if(!root) return 0;
+        return abs(sum(root->left) - sum(root->right)) + findTilt(root->left) + findTilt(root->right);
+    }
+
+private:
+    int sum(TreeNode* root){
+
+        if(!root) return 0;
+        return root->val + sum(root->left) + sum(root->right);
+    }
+};
+
+
+int main() {
+
+    return 0;
+}
diff --git a/0563-Binary-Tree-Tilt/cpp-0563/main2.cpp b/0563-Binary-Tree-Tilt/cpp-0563/main2.cpp
@@ -0,0 +1,51 @@
+/// Source : https://leetcode.com/problems/binary-tree-tilt/
+/// Author : liuyubobobo
+/// Time   : 2019-02-23
+
+#include <iostream>
+
+using namespace std;
+
+
+/// Recursive and use class variable to record the result
+/// Time Complexity: O(n)
+/// Space Complexity: O(h)
+
+/// Definition for a binary tree node.
+struct TreeNode {
+    int val;
+    TreeNode *left;
+    TreeNode *right;
+    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+};
+
+
+class Solution {
+
+private:
+    int result;
+
+public:
+    int findTilt(TreeNode* root) {
+
+        result = 0;
+        dfs(root);
+        return result;
+    }
+
+private:
+    int dfs(TreeNode* root){
+
+        if(!root) return 0;
+        int left = dfs(root->left);
+        int right = dfs(root->right);
+        result += abs(left - right);
+        return root->val + left + right;
+    }
+};
+
+
+int main() {
+
+    return 0;
+}
diff --git a/readme.md b/readme.md
@@ -396,6 +396,8 @@ email: [liuyubobobo@gmail.com](mailto:liuyubobobo@gmail.com)
 | | | | | | |
 | 561 | [Array Partition I](https://leetcode.com/problems/array-partition-i/description/) | [solution](https://leetcode.com/problems/array-partition-i/solution/) | [C++](0561-Array-Partition-I/cpp-0561/) | | |
 | | | | | | |
+| 563 | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt/) | [solution](https://leetcode.com/problems/binary-tree-tilt/solution/) | [C++](0563-Binary-Tree-Tilt/cpp-0563/) | | |
+| | | | | | |
 | 572 | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/description/) | [solution](https://leetcode.com/problems/subtree-of-another-tree/solution/) | [C++](0572-Subtree-of-Another-Tree/cpp-0572/) | | |
 | | | | | | |
 | 583 | [Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings/description/) | [solution](https://leetcode.com/problems/delete-operation-for-two-strings/solution/) | [C++](0583-Delete-Operation-for-Two-Strings/cpp-0583/) | | |
