leetcode 617 合并二叉树

617 合并二叉树

• 题目
  https://leetcode-cn.com/problems/merge-two-binary-trees/
• 代码

# 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: TreeNode, t2: TreeNode) -> TreeNode:
        if t1!=None and t2!=None:
            node=TreeNode(t1.val+t2.val)
            node.left=self.mergeTrees(t1.left,t2.left)
            node.right=self.mergeTrees(t1.right,t2.right)
            return node
        else:
            return t1 if t1!=None else t2

• 总结
  对数不太熟悉，光从思路来讲明白，但是具体操作起来还是有些困难。借鉴的霹雳拍啦的代码，链接如下
  https://blog.youkuaiyun.com/starmoth/article/details/88259300