I'm looking at symmetric trees and checking if two trees are mirrors of each other. That part is straightforward enough, but what I'm having trouble with is: say your computer isn't powerful enough to handle these two trees on its own. How can you make this scalable and run on multiple machines?
What options are there to make the mirror tree problem scalable?
algorithms;binary trees;parallel computing