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.
This class is .
This class acts like a / array.
This class is with the FOR EACH keyword.
|
See also