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

Function dfs

javascript/0101-symmetric-tree.js:20–28  ·  view source on GitHub ↗
(node1, node2)

Source from the content-addressed store, hash-verified

18};
19
20const dfs = (node1, node2) => {
21 if (!node1 && !node2) return true;
22
23 if (node1 && !node2) return false;
24 if (!node1 && node2) return false;
25 if (node1.val !== node2.val) return false;
26
27 return dfs(node1.right, node2.left) && dfs(node1.left, node2.right);
28};

Callers 1

isSymmetricFunction · 0.70

Calls

no outgoing calls

Tested by

no test coverage detected