Minimum Distance Between BST Nodes LeetCode solution in C++

1
class Solution {
2
  int minDiff = INT_MAX, prev = INT_MAX;
3

4
 public:
5
  void inorder(TreeNode *p) {
6
    if (p == NULL) return;
7
    inorder(p->left);
8
    minDiff = min(minDiff, abs(p->val - prev));
9
    prev = p->val;
10
    inorder(p->right);
11
  }
12
  int minDiffInBST(TreeNode *root) {
13
    inorder(root);
14
    return minDiff;
15
  }
16
};