From 195504c0e03c8509d4921ef1d90b15059cf48466 Mon Sep 17 00:00:00 2001
From: jojoo15 <75017412+jojoo15@users.noreply.github.com>
Date: Tue, 18 May 2021 11:33:32 +0200
Subject: [PATCH] =?UTF-8?q?Update=200617.=E5=90=88=E5=B9=B6=E4=BA=8C?=
=?UTF-8?q?=E5=8F=89=E6=A0=91.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
python version of code added
---
problems/0617.合并二叉树.md | 20 ++++++++++++++++++--
1 file changed, 18 insertions(+), 2 deletions(-)
diff --git a/problems/0617.合并二叉树.md b/problems/0617.合并二叉树.md
index 848454de..ce37a953 100644
--- a/problems/0617.合并二叉树.md
+++ b/problems/0617.合并二叉树.md
@@ -312,7 +312,23 @@ class Solution {
```
Python：
-
+```python
+# 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 mergeTrees(self, root1: TreeNode, root2: TreeNode) -> TreeNode:
+ if not root1: return root2 // 如果t1为空，合并之后就应该是t2
+ if not root2: return root1 // 如果t2为空，合并之后就应该是t1
+ root1.val = root1.val + root2.val //中
+ root1.left = self.mergeTrees(root1.left , root2.left) //左
+ root1.right = self.mergeTrees(root1.right , root2.right) //右
+ return root1 //root1修改了结构和数值
+```
Go：
@@ -323,4 +339,4 @@ Go：
* 作者微信：[程序员Carl](https://mp.weixin.qq.com/s/b66DFkOp8OOxdZC_xLZxfw)
* B站视频：[代码随想录](https://space.bilibili.com/525438321)
* 知识星球：[代码随想录](https://mp.weixin.qq.com/s/QVF6upVMSbgvZy8lHZS3CQ)
-
\ No newline at end of file
+
