Skip to main content

IBalancedBinarySearchTree

Short summary​

Interface for a balanced, binary, search tree

  • balanced means that every node has a balanced (see Tree_Balance)
  • binary means that every node has two childs (they can be null)
  • search means it is a set, every object can only be contained once

Attention: search not only means you can't store an object with the same hash only once, instead it means you can only one element with this comparevalue. So if you compare elements by size and you have five diffrent objects with the same size, only one of them can be stored

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

AccessAbstractFinalExtendsImplements
-NoNoIBalancedTree, IBinaryTree, ISearchTree-

UML Diagram​

Code​

Declaration​

INTERFACE IBalancedBinarySearchTree EXTENDS IBalancedTree, IBinaryTree, ISearchTree