Skip to content

Commit 5b1983f

Browse files
authored
Create 0783-minimum-distance-between-bst-nodes.js
1 parent 44b0e00 commit 5b1983f

File tree

1 file changed

+38
-0
lines changed

1 file changed

+38
-0
lines changed
Lines changed: 38 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,38 @@
1+
/**
2+
* Definition for a binary tree node.
3+
* function TreeNode(val, left, right) {
4+
* this.val = (val===undefined ? 0 : val)
5+
* this.left = (left===undefined ? null : left)
6+
* this.right = (right===undefined ? null : right)
7+
* }
8+
*/
9+
/**
10+
* DFS (level order traversal)
11+
* Time O(n) | Space O(n)
12+
* https://leetcode.com/problems/minimum-distance-between-bst-nodes/
13+
* @param {TreeNode} root
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+
31+
let min = Infinity;
32+
33+
for(let i = 1; i < sortedArr.length; i++) {
34+
min = Math.min(min, sortedArr[i] - sortedArr[i-1]);
35+
}
36+
37+
return min;
38+
};

0 commit comments

Comments
 (0)