来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/minimum-distance-between-bst-nodes/
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
给你一个二叉搜索树的根节点 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
提示:
/** * 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 minDiffInBST(TreeNode* root) { vector<int> nums; queue<TreeNode*> que; int min = INT_MAX; que.push(root); while (!que.empty()) { if ((que.front())->left) que.push((que.front())->left); if ((que.front())->right) que.push((que.front())->right); nums.push_back((que.front())->val); que.pop(); } for (int i = 0; i < nums.size(); ++i) { for (int j = i + 1; j < nums.size(); ++j) { min = abs(nums[i] - nums[j]) < min ? abs(nums[i] - nums[j]) : min; } } return min; } };