Competitive-Programming/Trie.cpp at master · Code-Cube-NITP/Competitive-Programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include<bits/stdc++.h>
#definefastioios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#defineendl'\n'
#defineintlonglongint
usingnamespacestd;
#definepii pair <int, int>
#definemii map<int, int>
#definepb push_back
#definedeb(x) cout << #x << "" << x << endl
#definedeb2(x, y) cout << #x << "" << x << "" << #y << "" << y << endl
#defineLoop(s, e, itr) for (int itr = s; itr < e; itr++)
#defineloop(n) for(int i = 0; i < n; i++)
#definevin vector<int>
#definew(t) int tc; cin >> tc; for(int t = 1; t <= tc; t++)
#definevec vector
#definemod1000000007
#defineall(x) x.begin(), x.end()

classTrie{
public:
structnode{
 node *child[26];
int count;
node(){
loop(26) child[i] = NULL;
 count = 0;
 }
 };

 node *head;
Trie(){
 node *temp = newnode();
 head = temp;
 }

voidinsert(string str){
int len = str.length();
 node* temp = head;
loop(len){
int p = str[i] - 'a';
if(temp->child[p] == NULL){
 node* n = newnode();
 temp->child[p] = n;
 }
 temp = temp->child[p];
 }
 temp->count++;
 }

intcount(node* hd){
int ans = 0;
if(hd->count != 0) ans++; // to count distinct strings
//ans += hd->count; // uncomment this line to count total strings (and comment just above line)
loop(26){
if(hd->child[i] != NULL){
 ans += count(hd->child[i]);
 }
 }
return ans;
 }

};

int32_tmain(){
 Trie *trie = newTrie();
 trie->insert("abc");
 trie->insert("ab");
 trie->insert("a");
 cout << trie->count(trie->head) << endl;
}