Leetcode #530 Minimum Absolute Difference in BST

时光未老丶

于 2017-03-01 10:58:30 发布

阅读量348

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/qq_32796425/article/details/59058114

版权

leetcode 专栏收录该内容

44 篇文章

订阅专栏

本文介绍了一种算法：给定一个非负值的二叉搜索树，找到任意两个节点值之间的最小绝对差。通过将所有节点值存入数组并排序，最后遍历数组求相邻节点值间的最小差值。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description

Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes.

Example

Input:

1
\
3
/
2

Output:
1

Explanation:
The minimum absolute difference is 1, which is the difference between 2 and 1 (or between 2 and 3).

Explain

将节点的值都放数组里sort一下然后遍历一遍

Code

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def getMinimumDifference(self, root):
        """
        :type root: TreeNode
        :rtype: int
        """
        minn = 1e10
        res = []
        node = []
        if root:
            node.append(root)
        while node:
            top = node.pop()
            res.append(top.val)
            if top.left:
                node.append(top.left)
            if top.right:
                node.append(top.right)
        res.sort()
        res_len = len(res)
        for i in range(0, res_len-1):
            minn = min(minn, abs(res[i]-res[i+1]))
        return minn