**Deleted**
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
**Deleted**
Last edited by MJS139115; May 17th, 2011 at 04:57 PM.
Related threads:
Re: Polymorphic Binary Search Tree Question
If there are no children, there is just a root. You can delete the tree by setting the root to null.
Re: Polymorphic Binary Search Tree Question
Ok.... I see you cross posted this on codeguru's forums..... The more info you provide the more help you will get. Post the code you have so far, and any of the project instructions
Re: Polymorphic Binary Search Tree Question
Originally Posted by DavidFongs
Not necessarily, the Node just has to be a leaf to have no children.
Re: Polymorphic Binary Search Tree Question
To check if it's an empty tree, all, theoretically, you'd need to know is if the data at the root is null.
If the root is null, in theory, all should be null.
Re: Polymorphic Binary Search Tree Question
No.... if a Node has no children it is a leaf or the root. If an entire tree has no children, it is just a root node
Not necessarily, the Node just has to be a leaf to have no children.
Reply With Quote