The use case for both are pretty much the same, but the key difference is that Radix Tree is compressed version of Trie, which is more memory efficient as there is no need to store each character in separated node. Although - Radix Tree is harder to implement. Considering an example list of words: - Tell - Team - Teacher They will be represented as follows: ![[trie-vs-radix.png]] ### See also 1. [[What is Trie?]] 2. [[What Radix Tree is?]] ### Reference 1.