代码随想录Day20|二叉树6_2|二叉搜索树_1

OctoberTE

已于 2023-07-31 17:30:59 修改

阅读量70

点赞数

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

于 2023-07-31 16:13:08 首次发布

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

版权

力扣刷题专栏收录该内容

36 篇文章 0 订阅

订阅专栏

700.二叉搜索树中的搜索

简单的判断值，递归

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

98.验证二叉搜索树

错误思路：中节点大于左节点and小于右节点

class Solution:
    def __init__(self):
        self.maxVal = -float('inf')
    def isValidBST(self, root: Optional[TreeNode]) -> bool:
        if not root:
            return True
        left = self.isValidBST(root.left)
        if maxVal<root.val:
            maxVal = root.val
        else:
            return False
        right = self.isValidBST(root.right)
        return left and right

530.二叉搜索树的最小绝对差

还是有点生疏，需要熟悉

class Solution:
    def getmin(self,node):
        if not node:
            return 
        
        self.getmin(node.left)
        if self.pre:
            self.ans = min(self.ans,abs(self.pre.val-node.val))
        self.pre = node
        self.getmin(node.right)

    
    def getMinimumDifference(self, root: Optional[TreeNode]) -> int:
        self.ans = float('inf')
        self.pre = None
        self.getmin(root)

        return self.ans

501.二叉搜索树中的众数

有点生疏，需要熟悉；有些判断条件没有仔细思考

class Solution:
    def traversal(self,node):
        if not node:
            return
        
        self.traversal(node.left)
        if self.pre is None:
            self.temp = 1
        elif self.pre.val==node.val:
            self.temp += 1
        else:
            self.temp = 1
        
        if self.maxC == self.temp:
            self.ansValue.append(node.val)
        elif self.maxC < self.temp:
            self.ansValue = [node.val]
            self.maxC = self.temp
        
        self.pre = node
        self.traversal(node.right)

    def findMode(self, root: Optional[TreeNode]) -> List[int]:
        self.pre = None
        self.maxC = 0
        self.temp = 0
        self.ansValue = []
        self.traversal(root)

        return self.ansValue