4 lines c#(sharp) solution, with recursion, beat 94.44%

  • 0
                if (p == null && q == null) return true;
                if (p == null || q == null) return false;
                if (p.val == q.val) return IsSameTree(p.left, q.left) && IsSameTree(p.right, q.right);
                return false;

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.