Every dispatch filed under “Data Structures” · 9 entries.
Implementing breadth-first search with a stack instead of the usual queue, and what changes when you flip the underlying data structure.
Understanding BFS and DFS graph traversal, the difference between visiting and exploring a node, with implementations and examples.
A diagram-first introduction to graph theory from a computer science angle, covering what graphs are, the different kinds, and their real-world uses....
A deep dive into the R-tree, the data-driven spatial index built on bounding rectangles, and how it powers range and nearest-neighbor queries....
How B-trees and B+ trees organize data on disk for fast lookups, starting from disk structure and why databases lean on them...
Introducing hybrid quad-kd and r-kd tree structures that combine the quadtree, KD-tree, and R-tree to speed up search over mixed point and...
Why geometric algorithms like the convex hull break under floating point arithmetic, and the round off errors that produce non-convex or never-ending...
An introduction to spatial indexing, comparing space-driven structures like the quadtree and KD-tree with data-driven ones like the R-tree.
How external merge sort handles datasets too large for memory, using a split phase and a priority queue driven K-way merge, walked...