时间轴

2025-10-31

init

题目：

P530 二叉搜索树的最小绝对差

https://leetcode.cn/problems/minimum-absolute-difference-in-bst/description/?envType=study-plan-v2&envId=top-interview-150


二叉搜索树的中序遍历是有序序列，因此只需要中序遍历比较邻近值大小即可
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
struct TreeNode {
	int val;
	TreeNode *left;
	TreeNode *right;
	TreeNode()
		: val(0)
		, left(nullptr)
		, right(nullptr)
	{
	}
	TreeNode(int x)
		: val(x)
		, left(nullptr)
		, right(nullptr)
	{
	}
	TreeNode(int x, TreeNode *left, TreeNode *right)
		: val(x)
		, left(left)
		, right(right)
	{
	}
};

#include <stack>
#include <algorithm>
#include <climits>
#include <cmath>

using std::stack;

class Solution {
    public:
	int getMinimumDifference(TreeNode *root)
	{ // 二叉搜索树，中序遍历是按顺序排列的

		stack<TreeNode *> st;
		TreeNode *p = root, *left, *right;
		int res = INT_MAX, last = INT_MAX;
		while (p || !st.empty()) {
			if (p) {
				st.push(p);
				p = p->left;
			} else {
			    // visit
				p = st.top();
				st.pop();
				res = std::min(res, std::abs(last - p->val));
				
				last = p->val;
				p = p->right;
			}
		}
		return res;
	}
};