Minimum Absolute Difference in BST
来源:互联网 发布:java文件命名 编辑:程序博客网 时间:2024/06/05 04:03
Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes.
Example:
Input: 1 \ 3 / 2Output:1Explanation:The minimum absolute difference is 1, which is the difference between 2 and 1 (or between 2 and 3).
Note: There are at least two nodes in this BST.
Solution:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int getMinimumDifference(TreeNode* root) {
int res = INT_MAX, pre = -1;
stack<TreeNode*> s;
TreeNode *p = root;
while (p || !s.empty()) {
while (p) {
s.push(p);
p = p->left;
}
p = s.top(); s.pop();
if (pre != -1) res = min(res, p->val - pre);
pre = p->val;
p = p->right;
}
return res;
}
};
- Minimum Absolute Difference in BST
- Minimum Absolute Difference in BST
- Minimum Absolute Difference in BST
- Minimum Absolute Difference in BST
- Minimum Absolute Difference in BST
- Minimum Absolute Difference in BST
- Minimum Absolute Difference in BST
- Minimum Absolute Difference in BST
- Leetcode-530. Minimum Absolute Difference in BST
- LeetCode: 503.Minimum Absolute Difference in BST
- 【Leetcode】530. Minimum Absolute Difference in BST
- Leetcode 530. Minimum Absolute Difference in BST
- 530. Minimum Absolute Difference in BST
- 530. Minimum Absolute Difference in BST
- Leetcode #530 Minimum Absolute Difference in BST
- [leetcode] 530. Minimum Absolute Difference in BST
- 530. Minimum Absolute Difference in BST
- LeetCode-530. Minimum Absolute Difference in BST
- Kotlin 空安全(null-safety):再见 NullPointerException
- 深入学习HBase架构原理
- 密码学扫盲:加密、认证、公钥、私钥
- 一步一图一代码,一定要让你真正彻底明白红黑树
- 自定义view进度条加强版
- Minimum Absolute Difference in BST
- debian 163各版本源
- DWR框架搭建以及使用
- 从产品设计到用户设计
- 视频直播系统
- bzoj 4827: [Hnoi2017]礼物 (FFT)
- HBase分布式环境安装部署
- dp与px
- 我就试试CSDN