Doubt in trie



can someone explain me,what is the difference between radix tree and suffix tree??


A [Radix tree][1] is a compressed trie such that every node necessarily has branching. All paths that look like a linked list are compressed into a single node.

A [Suffix Tree][3] is also a compressed suffix-trie except that it is built on a single string instead of on an array of strings, and given the property of a compressed suffix trie that we saw above, there can be at most O(n) nodes, where ā€˜nā€™ is the # of characters in the string.

The key difference is Radix Trees are built on lists or arrays of strings and Suffix trees are usually built on a single large string.

Hope it helps, Best Luck :slight_smile:


thanks a lot


@hariprasath always a pleasure :slight_smile: