**Radix Tree** is a optimized variant of Trie which includes chain of nodes compression. Node compression works in the way that **nodes that has ONLY single children are merged with their parents**. Radix tree example: ``` root | te / \ a ll / \ m cher ``` ### See also 1. [[What is Trie?]] 2. [[What's the difference between Trie and Radix Tree?]]