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

Function dfs

javascript/0783-minimum-distance-between-bst-nodes.js:27–35  ·  view source on GitHub ↗
(node, sortedArr)

Source from the content-addressed store, hash-verified

25};
26
27const dfs = (node, sortedArr) => {
28 if (!node) return;
29
30 dfs(node.left, sortedArr);
31 sortedArr.push(node.val);
32 dfs(node.right, sortedArr);
33
34 return sortedArr;
35};

Callers 1

minDiffInBSTFunction · 0.70

Calls 1

pushMethod · 0.45

Tested by

no test coverage detected