Recursive Java Solution


  • 0
    C
    public class Solution
    {
        public boolean isSameTree(TreeNode p, TreeNode q)
        {
            if(p == null && q == null)
                return true;
            if(p == null && q != null)
                return false;
            if(p != null && q == null)
                return false;
            if(p.val != q.val)
                return false;
            return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
        }
    }

Log in to reply
 

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