CS2308-Data-Structures-II/program-5.cpp at main · kavyabhand/CS2308-Data-Structures-II · 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
71
72
73
74
75
76
77
78
79
80
/*
Trie (Prefix Tree) Implementation
*/

#include <iostream>
using namespace std;

class TrieNode {
public:
    TrieNode* child[26];
    bool end;

    TrieNode() {
        end = false;
        for (int i = 0; i < 26; i++)
            child[i] = NULL;
    }
};

class Trie {
    TrieNode* root;

public:
    Trie() {
        root = new TrieNode();
    }

    void insert(string word) {
        TrieNode* cur = root;

        for (char c : word) {
            int idx = c - 'a';

            if (!cur->child[idx])
                cur->child[idx] = new TrieNode();

            cur = cur->child[idx];
        }

        cur->end = true;
    }

    bool search(string word) {
        TrieNode* cur = root;

        for (char c : word) {
            int idx = c - 'a';

            if (!cur->child[idx])
                return false;

            cur = cur->child[idx];
        }

        return cur->end;
    }
};

int main() {
    Trie t;

    int n;
    string s;

    cin >> n;

    for (int i = 0; i < n; i++) {
        cin >> s;
        t.insert(s);
    }

    cin >> s;

    if (t.search(s))
        cout << "Found";
    else
        cout << "Not Found";

    return 0;
}