can someone explain me,what is the difference between radix tree and suffix tree??
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 151 |
Name |
---|
A Trie is just a simple structure that you build from a list of words to support efficient O(w) querying/retrieval. 'w' being the length of the query.
A Radix tree 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. Use a Trie or a compressed Trie when you want to build a hash table where the keys will be strings (usually having an upper bound on their length). A Suffix Tree 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 number of characters in the string.