A self-balancing binary tree optimised for fast access to frequently used nodes. Useful for implementing caches and garbage collection algorithms.
Required Ruby Version
>= 2.0.0
Authors
Piotr Murach
A self-balancing binary tree optimised for fast access to frequently used nodes. Useful for implementing caches and garbage collection algorithms.
>= 2.0.0
Piotr Murach
