Pierwszy raz się z czymś takim spotykam. Podobno są tak samo wydajne jak drzewa
czerwono czarne, ale są prostsze w implementacji.

Cytat ze stacka:
[
An alternative to all these trees are AA-Trees. As this PDF paper suggests, AA-Trees
(which are in fact a sub-group of RB-Trees) are almost equal in performance to normal
RB-Trees, but they are much easier to implement than RB-Trees, AVL-Trees, or B-Trees.
Here is a full implementation, look how tiny it is (the main-function is not part of
the implementation and half of the implementation lines are actually comments).
]

Prawda czy fałsz?