Leetcode617. 合并二叉树 Merge Two Binary Trees - Python 递归法

princey2100

已于 2022-12-06 21:54:46 修改

阅读量353

点赞数

分类专栏： Leetcode刷题二叉树力扣文章标签： python 开发语言

于 2022-11-26 00:18:17 首次发布

本文链接：https://blog.csdn.net/rendalian/article/details/128046646

版权

Leetcode刷题同时被 3 个专栏收录

56 篇文章 1 订阅

订阅专栏

力扣

47 篇文章 0 订阅

订阅专栏

二叉树

35 篇文章 0 订阅

订阅专栏

思路：

1.若遇到root1非空，root2空，则把root1当前的根节点全都给到新树的对应根节点上。此题就这一个难点

构造新树的思路：

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def mergeTrees(self, root1: Optional[TreeNode], root2: Optional[TreeNode]) -> Optional[TreeNode]:

        

        def traversal(root1: Optional[TreeNode], root2: Optional[TreeNode]) -> Optional[TreeNode]:
            if not root1 and not root2:
                return

            if root1 and root2:
                root = TreeNode(root1.val + root2.val)
            elif root1 and not root2:
                root = root1
                return root
            else:
                root = root2
                return root
            
            root.left = traversal(root1.left, root2.left)
            root.right = traversal(root1.right, root2.right)
            return root
        
        return traversal(root1, root2)

改造root1的思路，节约空间和时间：

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def mergeTrees(self, root1: Optional[TreeNode], root2: Optional[TreeNode]) -> Optional[TreeNode]:

        

        def traversal(root1: Optional[TreeNode], root2: Optional[TreeNode]) -> Optional[TreeNode]:
            if not root1:   return root2
            if not root2:   return root1

            root1.val = root1.val + root2.val

            root1.left = traversal(root1.left, root2.left)
            root1.right = traversal(root1.right, root2.right)
            return root1
        
        return traversal(root1, root2)