LeetCode-Minimum_Absolute_Difference_in_BST

题目:

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.

翻译：

给定一个没有负值的二叉搜索树，找到任何两个节点的最小的绝对差。

例子:

输入:

   1
    \
     3
    /
   2

输出:
1

解释:
最小的绝对差是1，是2和1之间的绝对差（或2和3之间）。

注意: BST中最少由两个节点。

思路：参照https://www.cnblogs.com/grandyang/p/6540165.html

由于BST中，左<根<右，那么最小绝对差在左节点和父节点之间或父节点和右节点之间。所以对BST进行中序遍历，然后当前节点值和之前节点值求绝对差并更新结果res。对于没有的节点，用pre=-1来计算。

C++代码（Visual Studio 2017）：

#include "stdafx.h"
#include <iostream>
#include <algorithm>
using namespace std;

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;
		inorder(root, pre, res);
		return res;
	}
	void inorder(TreeNode* node, int& pre, int& res) {
		if (!node) return;
		inorder(node->left, pre, res);
		if (pre != -1) res = min(res, node->val - pre);
		pre = node->val;
		inorder(node->right, pre, res);
	}
};

int main()
{
	Solution s;
	TreeNode* root = new TreeNode(1);
	root->right = new TreeNode(3);
	root->right->left = new TreeNode(2);
	int result = s.getMinimumDifference(root);
	cout << result<<endl;
    return 0;
}