splay trees

Splay trees are self-adjusting binary search trees that prioritize recently accessed or modified elements. They accomplish this by splaying, which involves bringing the accessed element to the root through a series of rotations. This process improves the average and amortized time complexity for search, insertion, and deletion operations, making splay trees efficient in dynamic data sets.

Explore

Requires login.