Added problem 617

YUXUANCHENG · Jul 28, 2020 · ac8dc6d · ac8dc6d
1 parent cf50ec1
commit ac8dc6d
Show file tree

Hide file tree

Showing 2 changed files with 49 additions and 0 deletions.
diff --git a/617_merge/merge.cpp b/617_merge/merge.cpp
@@ -0,0 +1,26 @@
+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 {
+public:
+    TreeNode* mergeTrees(TreeNode* & t1, TreeNode* & t2) {
+        if(!t1 && !t2)
+            return t1;
+        if(t1 && t2)
+            t1->val += t2->val;
+        if(!t1)
+            t1 = new TreeNode(t2->val);
+        if(!t2)
+            t2 = new TreeNode(t1->val);
+        t1->left = mergeTrees(t1->left, t2->left);
+        t2->right = mergeTrees(t1->right, t2->right);
+        return t1;
+    }
+};
diff --git a/617_merge/recursion.cpp b/617_merge/recursion.cpp
@@ -0,0 +1,23 @@
+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 {
+    public: 
+    TreeNode * & mergeTrees(TreeNode * & t1, TreeNode * & t2) {
+        if (!t1)
+            return t2;
+        if (!t2)
+            return t1;
+        t1->val += t2->val;
+        t1->left = mergeTrees(t1->left, t2->left);
+        t1->right = mergeTrees(t1->right, t2->right);
+        return t1;
+    }
+};