C++: Recursive Solution 0ms


  • 0
    P
    /**
     * 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 || !q) return false;
            
            if( !isSameTree(p->left,q->left) ) return false;
            
            if( !isSameTree(p->right,q->right) ) return false;
            
            if( p && q )
            {
                if( p->val == q->val) return true;
                
            }
            
            return false;
        }
    };

Log in to reply
 

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