题目:
Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes.
Example:Input: 1 \ 3 / 2 Output: 1 Explanation: 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.
解释:
感觉和783. Minimum Distance Between BST Nodes(python+cpp)类似,也可以在遍历的过程中求最小值,甚至觉得代码都一模一样是怎么回事?
python代码:
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def getMinimumDifference(self, root):
"""
:type root: TreeNode
:rtype: int
"""
self._min=float('inf');
self.pre=float('-inf');
def middle(root):
if not root:
return
middle(root.left)
self._min=min(self._min,root.val-self.pre)
self.pre=root.val
middle(root.right)
middle(root)
return self._min
c++代码:
/**
* 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 _min=10000;
int pre=-10000;
int getMinimumDifference(TreeNode* root) {
middle(root);
return _min;
}
void middle(TreeNode* root)
{
if(!root)
return;
middle(root->left);
_min=min(_min,root->val-pre);
pre=root->val;
middle(root->right);
}
};
总结:
在遍历的过程中求最小值即可,无需先存储遍历结果再求值。