# LeetCode-783. Minimum Distance Between BST Nodes

## Description

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 following diagram:

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

1.The size of the BST will be between 2 and 100.
2.The BST is always valid, each node's value is an integer, and each node's value is different.

## Solution 1(C++)

class Solution {
public:
void helper(TreeNode* node, int &pre, int &ans){
if(!node) return;
helper(node->left, pre, ans);
if(pre!=-1) ans=min(ans, node->val-pre);
pre=node->val;
helper(node->right, pre, ans);
}
int minDiffInBST(TreeNode* root) {
int pre=-1, ans=INT_MAX;
helper(root, pre, ans);
return ans;
}
};

## 算法分析

LeetCode-530. Minimum Absolute Difference in BST 没什么区别。可以对前序遍历的编写多练习练习。

• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120