vaankiller
diff --git a/‎py_solution/617.
Copy file name to clipboard
+32Lines changed: 32 additions & 0 deletions b/‎py_solution/617.
Copy file name to clipboard
+32Lines changed: 32 additions & 0 deletions
diff --git a/‎py_solution/617. Merge Two Binary Trees.py
Copy file name to clipboard
+32Lines changed: 32 additions & 0 deletions b/‎py_solution/617. Merge Two Binary Trees.py
Copy file name to clipboard
+32Lines changed: 32 additions & 0 deletions
@@ -0,0 +1,32 @@
+# Definition for a binary tree node.
+# class TreeNode(object):
+#     def __init__(self, x):
+#         self.val = x
+#         self.left = None
+#         self.right = None
+
+class Solution(object):
+    def mergeTrees(self, t1, t2):
+        """
+        :type t1: TreeNode
+        :type t2: TreeNode
+        :rtype: TreeNode
+        """
+        
+        ret= None
+        
+        if t1 and t2:
+            ret = TreeNode(t1.val + t2.val)
+            ret.left = self.mergeTrees(t1.left, t2.left)
+            ret.right = self.mergeTrees(t1.right, t2.right)
+        elif t1:
+            ret = TreeNode(t1.val)
+            ret.left = self.mergeTrees(t1.left, None)
+            ret.right = self.mergeTrees(t1.right, None)
+        elif t2:
+            ret = TreeNode(t2.val)
+            ret.left = self.mergeTrees(t2.left, None)
+            ret.right = self.mergeTrees(t2.right, None)    
+            
+        return ret
+            
@@ -0,0 +1,32 @@
+# Definition for a binary tree node.
+# class TreeNode(object):
+#     def __init__(self, x):
+#         self.val = x
+#         self.left = None
+#         self.right = None
+
+class Solution(object):
+    def mergeTrees(self, t1, t2):
+        """
+        :type t1: TreeNode
+        :type t2: TreeNode
+        :rtype: TreeNode
+        """
+        
+        ret= None
+        
+        if t1 and t2:
+            ret = TreeNode(t1.val + t2.val)
+            ret.left = self.mergeTrees(t1.left, t2.left)
+            ret.right = self.mergeTrees(t1.right, t2.right)
+        elif t1:
+            ret = TreeNode(t1.val)
+            ret.left = self.mergeTrees(t1.left, None)
+            ret.right = self.mergeTrees(t1.right, None)
+        elif t2:
+            ret = TreeNode(t2.val)
+            ret.left = self.mergeTrees(t2.left, None)
+            ret.right = self.mergeTrees(t2.right, None)    
+            
+        return ret
+