给你一个二叉搜索树的根节点 root ,返回 树中任意两不同节点值之间的最小差值 。
差值是一个正数,其数值等于两值之差的绝对值。
示例 1:
输入:root = [4,2,6,1,3]
输出:1
示例 2:
输入:root = [1,0,48,null,null,12,49]
输出:1
提示:
树中节点的数目范围是 [2, 104]
0 <= Node.val <= 105
迭代写法:
/**
* Definition for a binary tree node.
* 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) {}
* };
*/
class Solution {
public:
int getMinimumDifference(TreeNode* root) {
int res = INT_MAX;
stack<TreeNode*> stk;
int prev = 0;
bool is_first = true;
while(root || stk.size()) {
while(root) {
stk.push(root);
root = root->left;
}
if(stk.size()) {
root = stk.top();
stk.pop();
if(is_first) is_first = false;
else res = min(res, root->val - prev);
prev = root->val;
root = root->right;
}
}
return res;
}
};
递归写法:
/**
* Definition for a binary tree node.
* 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) {}
* };
*/
class Solution {
public:
int res = INT_MAX;
int prev = 0;
bool is_first = true;
int getMinimumDifference(TreeNode* root) {
dfs(root);
return res;
}
void dfs(TreeNode* root) {
if(!root) return;
dfs(root->left);
// 中间,处理当前点
if(is_first) is_first = false;
else res = min(res, root->val - prev);
prev = root->val;
dfs(root->right);
}
};