A radix tree in Julia, built following Test Driven Development (TDD). Table of Contents 1 Introduction I recently discovered radix trees, also known as compressed tries. They are a specialised, space-optimised data structure for storing and searching through strings. They can be used for text suggestions in search engines and for predictive text. They are used in databases for storing IP addresses and for the inverted index of search engines.1 Source: en.wikipedia.org/wiki/Radix_tree. The above ...