A radix tree is a compressed trie: chains of single-child nodes are merged into one edge labeled with a string segment. It saves memory and reduces pointer chasing compared to a normal trie, while keeping fast prefix lookups. It’s used for things like routing tables and prefix-based search.