Trie vs Radix tree vs Patricia trie
<p>As I understand (also from <a href="https://stackoverflow.com/questions/14708134/what-is-the-difference-between-trie-and-radix-trie-data-structures">here</a>) memory-complexity of these DSs can be ordered like Trie > Radix > Patricia. But what about time-complexity? I assume they are almost same.</p>

<p>If to mention my problem, I want to do a lot of prefix search queries from pre-constructed dictionary. Memory is not a big concern for me. I want to use the fastest DS.</p>

<p>HAT-trie is best suit for me but it is too complex to implement.
Should I use Ternary Search Trees instead of any DSs mentioned above?</p>

<p>Thanks a lot!</p>