Are these Binary Trees Identical?

Given two binary trees, determine if they are identical. If they are, return true otherwise return false.

Example:  
       1              1
      / \            / \
     2   3    !=    2   3
    / \ / \        / \ / \
   4  5 6  7      4  5 6  7
  /
 8

Need a hand? Try out these hints, one at a time.

Quick hint to get things rolling

Recursively traverse the trees, comparing the nodes at each step.

Final hint! You should be able to code the problem on viewing this.

1. The base condition of recursion is that if both the roots are null, return true.

2. If only one of them is null, return false.

3. Compare the data of the two nodes. Return (root1.data == root2.data && isIdentical(root1.left, root2.left) && isIdentical(root1.right, root2.right))

public boolean isIdentical(TreeNode root1, TreeNode root2) {
    



}

This Coding Interview Question is available with an answer in the following programming languages :

Java

Python

Are these Binary Trees Identical?

Quick hint to get things rolling

Final hint! You should be able to code the problem on viewing this.

The interview prep tool you'll fall in love with!

This Coding Interview Question is available with an answer in the following programming languages :