Determine if two binary trees are equal

Question

What would be the efficient algorithm to find if two given binary trees are equal - in structure and content?

Answer 1

We can also do any of the two traversals (pre-order, post-order or in-order) and then compare the results of both the trees. If they are same, we can be sure of their equivalence.