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

Method dfs

java/0783-minimum-distance-between-bst-nodes.java:10–20  ·  view source on GitHub ↗
(TreeNode node)

Source from the content-addressed store, hash-verified

8 }
9
10 private void dfs(TreeNode node) {
11 if (node == null) {
12 return;
13 }
14 dfs(node.left);
15 if (prev != null) {
16 res = Math.min(res, node.val - prev.val);
17 }
18 prev = node;
19 dfs(node.right);
20 }
21}

Callers 1

minDiffInBSTMethod · 0.95

Calls

no outgoing calls

Tested by

no test coverage detected