Hey everyone, I'm working on an assignment for my data structures class and I'm having some trouble trying to understand an algorithm for a method. The method searches a binary tree (composed of strings) to check if any of the nodes are the reverse of the other (ie "cat" and "tac"). I've written a search method and tried to alter it for this, but I'm not having any luck, so I decided to start from scratch and just try to figure out the algorithm. I'm just having a problem understand how to search and compare each node. Any help or suggestions are appreciative.
Thanks!
Thanks!