A splay tree is a self-balancing binary search tree that automatically moves recently accessed elements to the root through a process called splaying. This post defines splay trees, explains the splay operation and its rotation cases, walks through common operations like search, insert, and delete, and analyzes time complexity.
