Data Structures Studio

Insert, delete, and traverse 27 data structures node by node, from arrays and linked lists to AVL trees, tries, and skip lists, with the code alongside.

All Data Structures (27)

• AVL Tree
• Binary Search Tree
• Bitset
• Bloom Filter
• Circular Buffer
• Circular Queue
• Deque
• Disjoint Set (Union-Find)
• Dynamic Array
• Fenwick Tree (BIT)
• Graph
• Hash Map
• Hash Set
• Heap
• LFU Cache
• Linked List
• LRU Cache
• Priority Queue
• Queue
• Red-Black Tree
• Segment Tree
• Skip List
• Sparse Matrix
• Splay Tree
• Stack
• Treap
• Trie