Trie-in-cpp/trie.cpp at master · Varun9198/Trie-in-cpp · 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
#include<bits/stdc++.h>
#define index s[i]-'a'
using namespace std;


class Trie{
public:

	class Node{
	public:
		Node *nodes[26];
		bool terminating;
		Node(){
			for(int i=0;i<26;++i)nodes[i]=NULL;
			terminating=0;
		}
	};

	Node *root = new Node;

	void insert(string s){
		Node *current = root;
		for(int i=0;i<s.size();++i){

			if(current->nodes[index]==NULL)
				current->nodes[index]=new Node;
			if(i==s.size()-1)current->terminating=1;

			current=current->nodes[index];
		}
	}

	bool find(string s){

		Node *current = root;
		for(int i=0;i<s.size();++i){

			if(current->nodes[index]==NULL)return 0;

			if(i==s.size()-1 and current->terminating==0)return 0;

			current=current->nodes[index];

		}

		return 1;

	}

};