Kent Beck Walks Us Through the Adaptive Radix Tree, One Decision at a Time

Adaptive Radix Tree: Sorted Maps for Fun and Profit

TLDR: Kent Beck is writing a book that teaches the Adaptive Radix Tree (ART) data structure by building it incrementally in Go, starting with the simplest possible naive trie and adding one optimization per chapter until the result matches a production-quality implementation. The primer sets up the motivation: why tries are worth knowing, what they trade off compared to hash maps and balanced BSTs, and what the chapter-by-chapter design journey looks like.

Adaptive Radix Tree