MCPcopy Create free account
hub / github.com/neetcode-gh/leetcode / dfs

Function dfs

javascript/0789-minimum-distance-between-two-bst-nodes.js:16–27  ·  view source on GitHub ↗
(node)

Source from the content-addressed store, hash-verified

14 let [prev, res] = [null, Number.MAX_VALUE];
15
16 function dfs(node) {
17 if (node) {
18 dfs(node.left);
19
20 if (prev) {
21 res = Math.min(res, node.val - prev.val);
22 }
23 prev = node;
24
25 dfs(node.right);
26 }
27 }
28
29 dfs(root);
30

Callers 1

minDiffInBSTFunction · 0.70

Calls

no outgoing calls

Tested by

no test coverage detected