For this Question: Given two binary trees, the task is to find if both of them are identical or not.
Note: Here identical means exactly same.User task:
Since this is a functional problem you don't have to worry about input, you just have to complete the function <b>isIdentical()</b>  that takes the root of both the trees as input.

Constraints:
1 <= T <= 10
1 <= N <= 100
1 <= Data of Nodes <= 100

For <b>Custom Input:</b>
The first line of input should contain the number of test cases T. For each test case, there will be two lines of input.
The first line contains a number of nodes N. Second line will be a string representing the tree as described below: 
The values in the string are such that for every parent you need to mention its child and state whether its is left or right like- 1 2 L 1 3 RFor each test case you need to return true or false based on whether they are identical or not. If the trees are identical then driver code will print 1 otherwise 0Sample Input:
       1
      /  \
    2     3        

       1
      /  \
    2     3

Sample Output:
1

Sample Input:-
       1
      /  \
    2     3
       1
      /  \
    3     2

Sample Output:-
0

Explanation:
Test case 1: 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.
Test case 2: There are two trees both having 3 nodes and 2 edges, but both trees are not identical, I have written this Solution Code:  static boolean isIdentical(Node root1, Node root2)
        {
           if (root1 == null && root2 == null) {
        return true;
    }
    if (root1 == null || root2 == null) {
        return false;
    }
    if (root1.data != root2.data) {
        return false;
    }
    return isIdentical(root1.left, root2.left) && isIdentical(root1.right, root2.right);
        }, In this Programming Language: Java, Now tell me if this Code is compilable or not?