代码随想录Day19|二叉树6_1|二叉树构造2

OctoberTE

已于 2023-07-30 20:12:27 修改

阅读量109

点赞数

分类专栏：力扣刷题文章标签： python leetcode

于 2023-07-29 15:42:41 首次发布

本文链接：https://blog.csdn.net/qq_43250021/article/details/131995675

版权

力扣刷题专栏收录该内容

36 篇文章 0 订阅

订阅专栏

文章介绍了两种二叉树操作：一是构建最大二叉树，通过选择列表中的最大值作为根节点，递归地构造左右子树；二是合并二叉树，将两个二叉树的节点值相加，形成新的二叉树。提供了简洁和非简洁两种实现方式。

摘要由CSDN通过智能技术生成

654.最大二叉树

构造二叉树的一般思路，比前后序或中后序构造害更不容易错一些

class Solution:
    def constructMaximumBinaryTree(self, nums: List[int]) -> Optional[TreeNode]:
        if len(nums)==0:
            return None
        
        rootVal = max(nums)
        idx = nums.index(rootVal)
        root = TreeNode(rootVal)

        root.left = self.constructMaximumBinaryTree(nums[:idx])
        root.right = self.constructMaximumBinaryTree(nums[idx+1:])
    
        return root

617.合并二叉树

V1 : 写出来的思路不简洁
V2 : 大佬版

class Solution:
    def mergeTrees(self, root1: Optional[TreeNode], root2: Optional[TreeNode]) -> Optional[TreeNode]:
        if not root1 and not root2:
            return None
        
        val = 0
        val += root1.val if root1 else 0
        val += root2.val if root2 else 0

        root = TreeNode(val)

        if root1 and root2:
            root.left = self.mergeTrees(root1.left,root2.left)
            root.right = self.mergeTrees(root1.right,root2.right)
        elif not root2:
            root.left = self.mergeTrees(root1.left,None)
            root.right = self.mergeTrees(root1.right,None)
        else:
            root.left = self.mergeTrees(None,root2.left)
            root.right = self.mergeTrees(None,root2.right)

        return root

class Solution:
    def mergeTrees(self, root1: Optional[TreeNode], root2: Optional[TreeNode]) -> Optional[TreeNode]:
        if not root1:
            return root2
        if not root2:
            return root1

        root = TreeNode(root1.val+root2.val)
        root.left = self.mergeTrees(root1.left,root2.left)
        root.right = self.mergeTrees(root1.right,root2.right)

        return root