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

File /home/Alvin/git_projects/octopress/source/downloads/code/binary_tree_equal.c could not be found