My C++ 0ms Solution


  • 0
    D
    bool isSameTree(TreeNode* p, TreeNode* q) {
        if(!q&&!p) return true;
        if((!p&&q)||(p&&!q)||(p->val!=q->val)) return false;
        return (isSameTree(p->left,q->left)&&isSameTree(p->right,q->right));
    }

  • 0
    S
        class Solution {
    public:
        bool isSameTree(TreeNode* p, TreeNode* q) {
            if (!p|!q) return  (!p  & !q );
            return (p->val==q->val)&&(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.