---
title: merge-two-binary-trees
date: 8100-01-01
tags: [计算机,算法,LeetCode]
---
## 简述
合并2个二叉树。
merge-two-binary-trees [英文](https://leetcode.com/problems/merge-two-binary-trees/) [中文](https://leetcode-cn.com/problems/merge-two-binary-trees/)
## 收获
1.判断空树
2.递归
3.`TreeNode` , `self.`
<!-- more -->

## 代码
```py
# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def mergeTrees(self, t1, t2):
        if t1 and t2:
            root = TreeNode(t1.val + t2.val)
            root.left = self.mergeTrees(t1.left, t2.left)
            root.right = self.mergeTrees(t1.right, t2.right)
            return root
        else:
            return t1 or t2

```