We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 5b1983f commit 8173003Copy full SHA for 8173003
javascript/0783-minimum-distance-between-bst-nodes.js
@@ -14,25 +14,22 @@
14
* @return {number}
15
*/
16
var minDiffInBST = function(root) {
17
-
18
- const sortedArr = [];
19
20
// levelOrderTraversal
21
- const dfs = (node) => {
22
- if(!node) return;
23
24
- dfs(node.left);
25
- sortedArr.push(node.val)
26
- dfs(node.right);
27
- }
28
29
- dfs(root);
30
+ const sortedArr = dfs(root, []);
+
31
let min = Infinity;
32
33
- for(let i = 1; i < sortedArr.length; i++) {
+ for (let i = 1; i < sortedArr.length; i++) {
34
min = Math.min(min, sortedArr[i] - sortedArr[i-1]);
35
}
36
37
return min;
38
};
+const dfs = (node, sortedArr) => {
+ if (!node) return;
+ dfs(node.left, sortedArr);
+ sortedArr.push(node.val)
+ dfs(node.right, sortedArr);
+ return sortedArr;
+}
0 commit comments