Choose a collection data structure:
— Please choose a data structure —
AVL tree
BST: Binary search tree
B-tree
Red-black tree
Splay tree
Linked List
Queue (Dynamic Array)
Queue (Linked List)
Stack (Dynamic Array)
Stack (Linked List)
Hash Table (Linear Probing)
Hash Table (Separate Chaining)
Insert many values
A L G O R I T H M
C O M P L E X I T Y
R E C U R S I O N
A B C D E F G H J K
Z Y X V T S P O M L
A B C D E … X Y Z
⏮︎
⏪︎
Run
⏩︎
⏭︎
Speed:
Slowest
Slow
Fast
Fastest
Node size:
Tiny
Small
Medium
Large
Huge
Reset pan and zoom