Data structures

Back

All data structures

• Array
• Avl tree
• Binary tree
• Bloom filter
• Binary search tree
• Circular buffer (ring buffer)
• Deque (double-ended queue)
• Dictionary
• Doubly linked list
• Dynamic array
• Fenwick tree (binary indexed tree)
• Graph
• Hash map
• Heap
• Lfu cache
• Lru cache
• Queue
• Red-black tree
• Segment tree
• Set
• Singly linked list
• Stack
• String
• Trie (prefix tree)
• Union-find (disjoint set union)

Comparisons of data structures

Measures for Data Structures

Space Complexity

• Memory usage (bytes, kilobytes)
• Overhead per element stored
• Cache locality/efficiency

Time Complexity of Operations

• Access: How fast can you retrieve an element? O(1), O(n), O(log n), etc.
• Search: How fast can you find an element?
• Insertion/Deletion: Cost of modifying the structure
• Traversal: Cost of visiting all elements