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
Quote:
Originally Posted by
DavidFongs
If there are no children, there is just a root. You can delete the tree by setting the root to null.
:-t
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
Quote:
Originally Posted by
javapenguin
:-t
Not necessarily, the Node just has to be a leaf to have no children.
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