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

Method dfs

java/0100-same-tree.java:24–39  ·  view source on GitHub ↗
(TreeNode p, TreeNode q)

Source from the content-addressed store, hash-verified

22 }
23
24 private boolean dfs(TreeNode p, TreeNode q) {
25 if (p == null && q == null) {
26 return true;
27 }
28
29 if (p == null || q == null) {
30 return false;
31 }
32
33 if (p.val != q.val) return false;
34
35 boolean left = dfs(p.left, q.left);
36 boolean right = dfs(p.right, q.right);
37
38 return left && right;
39 }
40}

Callers 1

isSameTreeMethod · 0.95

Calls

no outgoing calls

Tested by

no test coverage detected