IdenticalBinaryTree.cpp

/*Question:
Identical Binary Trees
Asked in:  
Amazon
Given two binary trees, write a function to check if they are equal or not.

Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

Return 0 / 1 ( 0 for false, 1 for true ) for this problem

Example :

Input : 

   1       1
  / \     / \
 2   3   2   3

Output : 
  1 or True
Seen this question in a real interview before
 */

/**
 * 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==NULL and B==NULL)
    return 1;
    if(A==NULL)
    return 0;
    if(B==NULL)
    return 0;
    if(A->val != B->val)
    return 0;
    if(A->val == B->val)
    {
    if(isSameTree(A->left,B->left) and isSameTree(A->right,B->right))
    return 1;
    }
}