题目
Given a Binary Search Tree (BST) with the root node root, return the minimum difference between the values of any two different nodes in the tree.
Example :Input: root = [4,2,6,1,3,null,null] Output: 1 Explanation: Note that root is a TreeNode object, not an array. The given tree [4,2,6,1,3,null,null] is represented by the followingdiagram: 4 / \ 2 6 / \ 1 3 while the minimum difference in this tree is 1, it occurs between node 1 and node 2, also between node 3 and node 2.
Note:
The size of the BST will be between 2 and 100. The BST is always valid, each node’s value is an integer, and each node’s value is different.
解释:
求BST结点的最小差值,因为是BST所以可以利用中序遍历。
中序遍历的过程中直接求差值,不需要遍历完成后再求差值的最小值。
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 minDiffInBST(self, root):
"""
:type root: TreeNode
:rtype: int
"""
self._min=float('inf')
#pre的初始化很重要,不可以是0
self.pre=-float('inf')
def middle(root):
if root==None:
return None
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++代码,10000是随便写的…:
/**
* 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 minDiffInBST(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);
}
};
总结:
能在遍历的过程中写就尽量在过程中写,