merge

简述

合并2个二叉树。
merge-two-binary-trees
英文 中文

收获

1.判断空树
2.递归
3.TreeNode , self.

代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None

class :
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