please suggest me some articles that explain implementation of trie using 2D arrays. Not using pointers. I Have found one article but I am unable to understand it from there. Please do help. Thanks in advance.
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 157 |
6 | maroonrk | 155 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | pajenegod | 145 |
please suggest me some articles that explain implementation of trie using 2D arrays. Not using pointers. I Have found one article but I am unable to understand it from there. Please do help. Thanks in advance.
Name |
---|
Here's a pretty neat code I use.
Features:
MAX_SUM_S
is number of nodes in the tree -conveniently, the sum of all string sizes inserted to the trie.add(str)
, and check for a prefix bycheck(str)
.MAX_SUM_S
or increase the size of first dimension oftr
.add(str ,root[x])
-initially all roots are set to 0.HERE IS A SIMPLE AND EASY TO UNDERSTAND IMPLEMENTATION USING MAP IN C++.
It is mainly used for string related queries. It is more space efficient.
Did you even read his post? It says "No Pointers"!
Here is a simple code written in C++ that i use for trie. This code insert string into trie.