splay_tree provides data structures such as map, set and heap which are based on an in-place top-down splay tree.

A splay tree is a self-adjusting binary search tree with the additional property that recently accessed elements are quick to access again. It performs basic operations such as insertion, look-up and removal in O(log n) amortized time. - Splay tree (Wikipedia)

See RustDoc Documentation.

The documentation includes some examples.

• https://en.wikipedia.org/wiki/Splay_tree
• http://digital.cs.usu.edu/~allan/DS/Notes/Ch22.pdf

This library is released under the MIT License.

See the LICENSE file for full license information.