LeetCode-617-合并二叉树

617. 合并二叉树

说明

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

你需要将他们合并为一个新的二叉树。合并的规则是如果两个节点重叠，那么将他们的值相加作为节点合并后的新值，否则不为 NULL 的节点将直接作为新二叉树的节点。

示例

输入: 
	Tree 1                     Tree 2                  
          1                         2                             
         / \                       / \                            
        3   2                     1   3                        
       /                           \   \                      
      5                             4   7                  
输出: 
合并后的树:
	     3
	    / \
	   4   5
	  / \   \ 
	 5   4   7

题解思路

1、递归实现,深度优先搜索
2、广度优先搜索：使用3个队列分别存储两个二叉树和目标树的节点

代码实现

深度优先搜索

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

class Solution(object):
    def mergeTrees(self, t1, t2):
        """
        :type t1: TreeNode
        :type t2: TreeNode
        :rtype: TreeNode
        """
        ans = t1
        def dfs(node1, node2, ans):
            if not (node1 and node2):
                if node1:
                    return node1
                else:
                    return node2
            ans.val = node1.val + node2.val
            ans.left = dfs(node1.left, node2.left, ans.left)
            ans.right = dfs(node1.right, node2.right, ans.right)
            return ans
        return dfs(t1, t2, ans)

广度优先搜索

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

class Solution(object):
    def mergeTrees(self, t1, t2):
        """
        :type t1: TreeNode
        :type t2: TreeNode
        :rtype: TreeNode
        """
        if not t1:
            return t2
        if not t2:
            return t1
        merge = TreeNode(t1.val + t2.val)
        deque1 = collections.deque([t1])
        deque2 = collections.deque([t2])
        deque = collections.deque([merge])
        while deque1 and deque2:
            node = deque.popleft()
            node1 = deque1.popleft()
            node2 = deque2.popleft()
            left1 = node1.left
            right1 = node1.right
            left2 = node2.left
            right2 = node2.right
            if left1 or left2:
                if left1 and left2:
                    deque1.append(left1)
                    deque2.append(left2)
                    node.left = TreeNode(left1.val + left2.val)
                    deque.append(node.left)
                if not left1:
                    node.left = left2
                if not left2:
                    node.left = left1
            if right1 or right2:
                if right1 and right2:
                    deque1.append(right1)
                    deque2.append(right2)
                    node.right = TreeNode(right1.val + right2.val)
                    deque.append(node.right)
                if not right1:
                    node.right = right2
                if not right2:
                    node.right = right1
        return merge