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 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 148 |
9 | pajenegod | 145 |
10 | BledDest | 144 |
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.