代码随想录算法训练营第十七天| 第六章 二叉树part06

今天一共四道题：

654. 最大二叉树

和昨天的呢导体很像，且比呢一道题要简单

# 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]:
        def cons(nums):
            if not nums:
                return
            ## 确定最大值
            max_1 = max(nums)
            root = TreeNode(max_1)
            ## 准备分割数组
            index  = nums.index(max_1)
            numsleft = nums[:index]
            numsright= nums[index+1:]
            ## 左右子树
            root.left = cons(numsleft)
            root.right = cons(numsright)
            return root
        return cons(nums)
            

第二道：617.合并二叉树

这道题有一个新的思想没有把握住，也不用重新创立树，在原有树上进行创作就可以

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

第三道：700. 二叉搜索树中的搜索

使用的前序遍历，感觉也还可以，解答出来

# 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]:
        temp = []
        def search(root,val1):
            ## 还是先设置递归终止
            if not root:
                return
            if root.val == val1:
                temp.append(root)
            if root.left:
                search(root.left,val1)
            if root.right:
                search(root.right,val1)
        search(root,val)
        if temp != []:
            return temp[0]
        return None

第四道：把握住二叉搜索数的特点，一开始就踩坑了，以为是只要用后序遍历，左比中小，右比中大就可以，但是这不是二叉搜索树。用中序遍历，二叉搜索树应该是一个从小到大排序的数组

# 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:
        max_val = [] 
        def isV(root,max_val):
            if not root:
                return
            isV(root.left,max_val)
            max_val.append(root.val)
            isV(root.right,max_val)
        isV(root,max_val)
        for i in range(1,len(max_val)):
            if max_val[i] <= max_val[i-1]:
                return False
        return True