trival
/**
* 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:
vector<int> result;
void midSearch(TreeNode* root)
{
if(root==NULL) return;
midSearch(root->left);
result.push_back(root->val);
midSearch(root->right);
}
int getMinimumDifference(TreeNode* root) {
midSearch(root);
if(result.size()<=1)
return 0;
int distance=result[1]-result[0];
for(int i=1;i<result.size()-1;i++)
{
if(result[i+1]-result[i]<distance)
distance=abs(result[i+1]-result[i]);
}
return distance;
}
};