Is a same Tree if p's leftTree equals q's rightTree?


  • 0
    0
    public boolean isSameTree(TreeNode p, TreeNode q) {
        if(p==null && q!=null) return false;
        if(p!=null && q==null) return false;
        if(p==null && q==null) return true;
        if(p.val!=q.val) return false;
        
        boolean a=isSameTree(p.left,q.left);
        boolean b=isSameTree(p.right,q.right);
        boolean x=isSameTree(p.left,q.right);
        boolean y=isSameTree(p.right,q.left);
        
        return (a&&b) || (x&&y);
        
    }

Log in to reply
 

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