A self-balancing binary tree optimised for fast access to frequently used nodes.
-
Updated
Mar 23, 2024 - Ruby
A self-balancing binary tree optimised for fast access to frequently used nodes.
Program accepts integers one by one and sorts them into a self balancing splay tree. Search and delete functions
Splay Tray in Java with tree filling from a txt file.
Associative container with the ability to search more efficiently if you know the key will be there. On par with std::map and well against std::unordered_map for most keys sizes, and especially where you have large keys with common prefixes.
Add a description, image, and links to the splaytree topic page so that developers can more easily learn about it.
To associate your repository with the splaytree topic, visit your repo's landing page and select "manage topics."