Self Optimizing Binary Search Tree

Introduction

A splay tree is a data structure that was invented by computer science professors Daniel Sleator and Robert Tarjan in 1985.

While most self balancing binary search trees are designed to decrease the worst case time for a single operation, Slaetor and Tarjan designed the splay tree is to reduce the time for a sequence of operations.

A splay tree is a self adjusting binary search tree that “splays” an element any time it is accessed. Splaying is the process of moving the given element to the root of the tree through a series of rotations. Therefore, the node is…

Elias Mann

Undergraduate Computer Science student at the Southern Methodist University (Class of 2023)

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store