代码随想录训练营Day20|● 654.最大二叉树 ● 617.合并二叉树 ● 700.二叉搜索树中的搜索 ● 98.验证二叉搜索树

最新推荐文章于 2024-11-02 15:25:13 发布

染尘*

最新推荐文章于 2024-11-02 15:25:13 发布

阅读量94

点赞数

文章标签：算法数据结构 python leetcode 职场和发展

本文链接：https://blog.csdn.net/weixin_44174445/article/details/130335025

版权

学习目标

654.最大二叉树
617.合并二叉树
700.二叉搜索树中的搜索
98.验证二叉搜索树

学习内容

654.最大二叉树

654. 最大二叉树 - 力扣（LeetCode）https://leetcode.cn/problems/maximum-binary-tree/

# 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 constructMaximumBinaryTree(self, nums: List[int]) -> Optional[TreeNode]:
        if not nums:return None
        n = len(nums)
        target = 0
        index = 0
        for i in range(n):
            if nums[i]>=target:
                target = nums[i]
                index = i
        root = TreeNode(val = nums[index])
        root.left = self.constructMaximumBinaryTree(nums[0:index])
        root.right = self.constructMaximumBinaryTree(nums[index+1:n])
        return root

617.合并二叉树

617. 合并二叉树 - 力扣（LeetCode）https://leetcode.cn/problems/merge-two-binary-trees/

# 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 creat_tree(root1,root2):
            if not root1:return root2
            elif not root2:return root1
            else:
                root1.val += root2.val
                root1.left = creat_tree(root1.left, root2.left)
                root1.right = creat_tree(root1.right,root2.right)
                return root1
        return creat_tree(root1,root2)

700.二叉搜索树中的搜索

700. 二叉搜索树中的搜索 - 力扣（LeetCode）https://leetcode.cn/problems/search-in-a-binary-search-tree/

# 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 searchBST(self, root: Optional[TreeNode], val: int) -> Optional[TreeNode]:
        if not root:return None
        if root.val == val:return root
        elif root.val<val:
            root = self.searchBST(root.right,val)
        else:
            root = self.searchBST(root.left,val)
        return root

98.验证二叉搜索树

98. 验证二叉搜索树 - 力扣（LeetCode）https://leetcode.cn/problems/validate-binary-search-tree/

# 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 isValidBST(self, root: Optional[TreeNode]) -> bool:
        def search_tree(root):
            if not root:return []
            return search_tree(root.left)+[root.val]+search_tree(root.right)
        res = search_tree(root)
        n = len(res)
        for i in range(1,n):
            if res[i]<=res[i-1]:
                return False
        return True