给你一个二叉搜索树的根节点 root ,返回 树中任意两不同节点值之间的最小差值 。
注意:本题与 530:https://leetcode-cn.com/problems/minimum-absolute-difference-in-bst/ 相同
示例 1:
输入:root = [4,2,6,1,3]
输出:1
示例 2:
输入:root = [1,0,48,null,null,12,49]
输出:1
提示:
树中节点数目在范围 [2, 100] 内
0 <= Node.val <= 105
class Solution {
public:
int minDiffInBST(TreeNode* root) {
midTree(root);
int min = INT_MAX;
for (int i = 1; i < arr.size(); i++) {
if ((arr[i] - arr[i - 1]) < min) {
min = arr[i] - arr[i - 1];
}
}
return min;
}
void midTree(TreeNode* root) {
if (root->left) {
midTree(root->left);
}
arr.push_back(root->val);
if (root->right) {
midTree(root->right);
}
}
private:
vector<int> arr;
};