Data-Structures-and-Algorithms/DS implementations/TRIES/practice.cpp at master · Manvityagi/Data-Structures-and-Algorithms · 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
#include<bits/stdc++.h>
using namespace std;

class Trie{
    struct node{
        bool end;
        unordered_map<char,node*> child;
        node() : end(false){}
    };
    struct node* root;
    public:

    void add(string &s){
        node* cur = root;
        for(char i : s){
            if(cur->child.count(i) == 0) cur->child[i] = new node;
            cur = cur->child[i];
        }
        cur->end = true;
    }

    bool prefixMatch(string &s){
        node* cur = root;
        for(char i : s){
            if(cur->child.count(i) == 0) return false;
            cur = cur->child[i];
        }
        return 1;
    }

    bool stringPresent(string &s){
        node* cur = root;
        for(char i : s){
            if(cur->child.count(i) == 0) return false;
            cur = cur->child[i];
        }
        return cur->end;
    }

};