Identical Binary Trees

Identical Binary Trees - InterviewBitInterviewBit

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
int Solution::isSameTree(TreeNode* A, TreeNode* B) {
    if(!A && !B)
        return true;
    if(!A && B || A && !B) 
        return false;
        
    if(A->val != B->val)
        return false;
        
    return isSameTree(A->left, B->left) && isSameTree(A->right, B->right);
}