Splay Tree

A Splay Tree is a self-balancing binary search tree that always moves the most recently accessed element to the root. This ensures that the most frequently accessed elements are quickly accessible, making it an efficient data structure for applications where frequent access to recently used elements is common.

Enter a number:

Curious to Learn More?

Hand-picked resources to deepen your understanding

Beginner Friendly

Grokking Algorithms

A friendly, fully illustrated guide. The best starting point for visual learners.

Practical Guide

A Common-Sense Guide to Data Structures and Algorithms

A practical guide with clear explanations and real-world examples.

Deep Dive

Introduction to Algorithms

The definitive guide (CLRS). Comprehensive and rigorous, perfect for deep diving into theory.

As an Amazon Associate, I earn from qualifying purchases. This helps support the site at no extra cost to you.

SORTING

Bubble Sort

Insertion Sort

Selection Sort

Heap Sort

Radix Sort

Merge Sort

Quick Sort

GRAPH

Depth First Search

Breadth First Search

Prim's Algorithm

Kruskal's Algorithm

Borůvka's Algorithm

Dijkstra's Algorithm

Topological Sorting

Hamiltonian Cycle

DATA STRUCTURES

Circular Queue

Linked List

Binary Heap

Binary Search Tree

AVL Tree

Red-Black Tree

Splay Tree

OTHER

Convex Hull

Huffman Coding

Splay Tree

Curious to Learn More?

Grokking Algorithms

A Common-Sense Guide to Data Structures and Algorithms

Introduction to Algorithms