IBinaryTree
Short summary
a tree where every node has up to two child nodes
Warning: Do not change the compare value of objects while they are in the tree, doing so will destroy your tree which can lead to not finding elements, hurt of search and balanced properties and os on. If you have to alter the value the correct way is: remove from tree, alter, insert. Same applies for foreach / iterate do not perform any operations changing the comparevalue
| Access | Abstract | Final | Extends | Implements |
|---|---|---|---|---|
| - | No | No | ITree | - |
UML Diagram
Code
Declaration
INTERFACE IBinaryTree EXTENDS ITree