Five line 0ms C++ solution


  • 0
    Y
    /**
     * Definition for a binary tree node.
     * struct TreeNode {
     *     int val;
     *     TreeNode *left;
     *     TreeNode *right;
     *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
     * };
     */
    class Solution {
    public:
        bool isSameTree(TreeNode* p, TreeNode* q) {
            if (!(p||q)) return true;
            if (!(p==NULL)^(q==NULL)) 
                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.