Add solution #783

Author: JoshCrozier

README.md

@@ -457,6 +457,7 @@
 748|[Shortest Completing Word](./0748-shortest-completing-word.js)|Easy|
 762|[Prime Number of Set Bits in Binary Representation](./0762-prime-number-of-set-bits-in-binary-representation.js)|Easy|
 763|[Partition Labels](./0763-partition-labels.js)|Medium|
+783|[Minimum Distance Between BST Nodes](./0783-minimum-distance-between-bst-nodes.js)|Easy|
 784|[Letter Case Permutation](./0784-letter-case-permutation.js)|Medium|
 790|[Domino and Tromino Tiling](./0790-domino-and-tromino-tiling.js)|Medium|
 791|[Custom Sort String](./0791-custom-sort-string.js)|Medium|

solutions/0783-minimum-distance-between-bst-nodes.js

@@ -0,0 +1,36 @@
+/**
+ * 783. Minimum Distance Between BST Nodes
+ * https://leetcode.com/problems/minimum-distance-between-bst-nodes/
+ * Difficulty: Easy
+ *
+ * Given the root of a Binary Search Tree (BST), return the minimum difference between
+ * the values of any two different nodes in the tree.
+ */
+
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @return {number}
+ */
+var minDiffInBST = function(root) {
+  let result = Infinity;
+  let previous = null;
+
+  inorder(root);
+  return result;
+
+  function inorder(node) {
+    if (!node) return;
+    inorder(node.left);
+    result = previous === null ? result : Math.min(result, node.val - previous);
+    previous = node.val;
+    inorder(node.right);
+  }
+};