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

发表于 更新于 分类于
这是文章开头，显示在主页面，详情请点击此处。
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
# 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 __init__(self):
        self.pre = None
        self.min_diff = 10**5
    def getMinimumDifference(self, root: Optional[TreeNode]) -> int:  
        if root==None: return 
        self.getMinimumDifference(root.left)
        if self.pre!=None:
            self.min_diff = min(root.val-self.pre.val,self.min_diff)
        self.pre = root 
        self.getMinimumDifference(root.right)
        return self.min_diff