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

最新推荐文章于 2025-06-14 21:10:57 发布

芒果香菠菠

最新推荐文章于 2025-06-14 21:10:57 发布

阅读量346

点赞数 6

文章标签： python 开发语言

本文链接：https://blog.youkuaiyun.com/weixin_42396719/article/details/135802233

版权

# 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 getMinimumDifference(self, root: Optional[TreeNode]) -> int:
        treelist = []
        self.traversal(root, treelist)
        minimun = float('inf')
        for i in range(1, len(treelist)):
            minimun = min(minimun, treelist[i] - treelist[i-1])
        return minimun
    def traversal(self, root, treelist):
        if not root:
            return
        self.traversal(root.left, treelist)
        treelist.append(root.val)
        self.traversal(root.right, treelist)