Minimum Distance Between BST Nodes LeetCode solution in JavaScript

1
/**
2
 * @param {TreeNode} root
3
 * @return {number}
4
 */
5
var minDiffInBST = function (root) {
6
  let arr = [];
7

8
  const helper = (node) => {
9
    if (node) {
10
      helper(node.left);
11
      arr.push(node.val);
12
      helper(node.right);
13
    }
14
  };
15
  helper(root);
16

17
  let min = Infinity;
18
  for (let i = 0; i < arr.length - 1; i++) {
19
    const diff = Math.abs(arr[i] - arr[i + 1]);
20
    min = Math.min(min, diff);
21
  }
22

23
  return min;
24
};