Check if two binary trees are identical. Identical means the two binary trees have the same structure and every identical position has the same value.
1 1 / \ / \ 2 2 and 2 2 / / 4 4
1 1 / \ / \ 2 3 and 2 3 / \ 4 4
are not identical.
This can be easily implemented using a recursive algorithm as shown below. In the algorithm, we first check to see if the root nodes
b are the same. We know the tree are not identical if the value of
b are not the same. If the current nodes are the same, we recursively check the left child and right child of both trees and the process repeats.