Welcome back to Code Corner. Today we’re diving into five weird but incredibly useful data structures you might not have met yet. First up, Bloom filters. As the video explains, “A Bloom filter is a probabilistic data structure that can tell you if something is possibly in a set,” all while using very little memory. Next, skip lists—think of a linked list on rocket fuel. By maintaining multiple forward pointers, they deliver “O(log n) average search time” without the complexity of balancing trees. Then there’s the rope, which treats long strings as balanced trees for lightning-fast insertions and deletions. Fourth, splay trees automatically move the most-recently accessed item to the root, giving you “amortized logarithmic performance” and excellent caching behavior. Finally, quadtrees slice two-dimensional space into four quadrants at each node, making them perfect for spatial indexing in graphics and games. Five unusual structures, each with its own superpower—give them a try!
Link to Article