AvlTree (gb.data)

An AVL tree is a self-balancing binary search tree. This means that we can guarantee insertion, removal and retrieval of data in O(log n) time, no matter what data you have in the tree. Its interface is similar to that of a Collection.

Esta clase es instanciable.

Esta clase actúa como un array de lectura / escritura.

Esta clase es enumerable con la palabra clave FOR EACH.

Balance   Return the balance factor of the AvlTree. It is either -1, 0 or 1.
Count   Return the number of elements in the tree.
Height   Return the height of the tree.
Key   Return the last used key. This can be Null if the element was removed meanwhile.

Clear   Clear the tree, i.e. remove all elements. This is way faster than removing every element by assigning Null to it like
Exist   Return whether an element with the given key exists.

See also