Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
Traversing a binary tree while looking for a string
I am unsure how to look to see if the string in the current node is the same as the message I am looking for.I thought about using compareTo(), but then I wasn't sure if what would work or not. So far I have:
public void searchRooms(MountainCave theParent, String name, String message){ if(theParent == null){ return false; }else if(theParent.String.compareTo(message){ return true; }//else if( ) }
Related threads:
Re: Traversing a binary tree while looking for a string
Did it work?
What happens?
What does the API say about comparing Strings?
Reply With Quote