Determine_if_Two_Trees_are_Identical.cpp

/*
Problem Statement:
-----------------
Given two binary trees, the task is to find if both of them are identical or not. 

Example 2:
----------
Input:
     1          1
   /   \      /   \
  2     3    2     3
Output: Yes
Explanation: There are two trees both having 3 nodes and 2 edges, both trees are identical having the root as 1, left child of 1 is 2 and right child of 1 is 3.

Example 2:
---------
Input:
    1       1
  /  \     /  \
 2    3   3    2
Output: No
Explanation: There are two trees both having 3 nodes and 2 edges, but both
trees are not identical.

Your task: Since this is a functional problem you don't have to worry about input, you just have to complete the function isIdentical() that takes two roots as parameters 
and returns true or false. The printing is done by the driver code.

Expected Time Complexity: O(N).
Expected Auxiliary Space: O(Height of the Tree).
*/

// Link --> https://practice.geeksforgeeks.org/problems/determine-if-two-trees-are-identical/1

// Code:
class Solution
{
    public:
    bool isIdentical(Node *r1 , Node *r2)
    {
        if(r1 == NULL and r2 == NULL)
            return true;
        
        if(r1!=NULL and r2!=NULL)
            return (r1->data == r2->data) and 
            isIdentical(r1->left , r2->left) and isIdentical(r1->right , r2->right);
        
        return false;
    }
};