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

654. 最大二叉树

题目链接 | 解题思路

class Solution:
    def constructMaximumBinaryTree(self, nums: List[int]) -> Optional[TreeNode]:
        if nums == []:
            return None

        max_value = max(nums)
        max_idx = nums.index(max_value)
        curr_node = TreeNode(val=max_value)
        curr_node.left = self.constructMaximumBinaryTree(nums[:max_idx])
        curr_node.right = self.constructMaximumBinaryTree(nums[max_idx+1:])
        return curr_node

617. 合并二叉树

题目链接 | 解题思路

class Solution:
    def constructMaximumBinaryTree(self, nums: List[int]) -> Optional[TreeNode]:
        if nums == []:
            return None

        max_value = max(nums)
        max_idx = nums.index(max_value)
        curr_node = TreeNode(val=max_value)
        curr_node.left = self.constructMaximumBinaryTree(nums[:max_idx])
        curr_node.right = self.constructMaximumBinaryTree(nums[max_idx+1:])
        return curr_node

700. 二叉搜索树中的搜索

题目链接 | 解题思路

class Solution:
    def searchBST(self, root: Optional[TreeNode], val: int) -> Optional[TreeNode]:
        if root == None:
            return None
        if root.val == val:
            return root
        if root.val < val:
            return self.searchBST(root.right, val)
        if root.val > val:
            return self.searchBST(root.left, val)

98. 验证二叉搜索树

题目链接 | 解题思路

class Solution:
    def limitedValidBST(self, node: Optional[TreeNode], lower: int, upper: int) -> bool:
        if node == None:
            return True
        
        result = True
        if node.left != None:
            if node.left.val >= node.val or node.left.val <= lower:
                return False
            result = result and self.limitedValidBST(node.left, lower, node.val)
        if node.right != None:
            if node.right.val <= node.val or node.right.val >= upper:
                return False
            result = result and self.limitedValidBST(node.right, node.val, upper)
        return result

    def isValidBST(self, root: Optional[TreeNode]) -> bool:
        return self.limitedValidBST(root, float("-inf"), float("inf"))