Radix Tree
Data Structures Project
Project Description
Radix tree (also radix trie or compact prefix tree) is a data structure that represents a space-optimized trie in which each node that is the only child is merged with its parent. The result is that the number of children of every internal node is at least the radix r of the radix tree
approach Documentation
Aitor Gandia 
Leave a comment