LeetCode: Same Tree Solution

Approach

Check if both node of p and q are the same, then recursively check the child nodes

Implementation

1var isSameTree = function (p, q) {
2  if (!p && !q) return true
3  if (!p || !q) return false
4  if (p.val !== q.val) return false
5  return isSameTree(p.left, q.left) && isSameTree(p.right, q.right)
6}

References

Original problem