617. 合并二叉树

题目描述：给定两个二叉树，想象当你将它们中的一个覆盖到另一个上时，两个二叉树的一些节点便会重叠。

你需要将他们合并为一个新的二叉树。合并的规则是如果两个节点重叠，那么将他们的值相加作为节点合并后的新值，否则不为 NULL 的节点将直接作为新二叉树的节点。
解题思路：递归调用，如果一个是None，就直接返回另一个，否则将右边的值加到左边上，然后递归调用处理左边的子树和右边的子树，代码如下：

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

思路二：用栈前序遍历的方法

# 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 is None: return t2
        if t2 is None: return t1
        s = [t1, t2]
        while(s):
            node2 = s.pop()
            node1 = s.pop()
            node1.val += node2.val
            if node1.right and node2.right:
                s.append(node1.right)
                s.append(node2.right)
            elif node2.right:
                node1.right = node2.right
            if node1.left and node2.left:
                s.append(node1.left)
                s.append(node2.left)
            elif node2.left:
                node1.left = node2.left
        return t1