can anyone tell me the best way to do a program for listing all the non common elements of two binary balanced trees? which are the best data structures to use in this case?
thanx!