Trie Implementation using class.

// Trie Implementation using class in C++

#include <iostream>
#include <bits/stdc++.h>
using namespace std;


class Node{
    public :
    Node* child[27];
    bool end;
};

class trie{
    private:
    Node * root;
    public:
    trie(){
        root = new Node();
    }
    void insert(string s){
        Node * p = root;
        for(int i=0; i<s.size(); i++){
            if(!p->child[s[i]-'a']){
                p->child[s[i]-'a'] = new Node();
            }
            p = p->child[s[i]-'a'];
            if(p->end){
                p->end= false;
            }
        }
        p->end = true;
        return;
    }
    bool search(string s){
        Node * p = root;
        for(int i=0; i<s.size(); i++){
            if(!p->child[s[i]-'a']){
                return false;
            }
            p=p->child[s[i]-'a'];
        }
        return p->end;
    }
};

int main(){
    trie t;
    vector<string> s = {"yahoo", "raj", "use"};
    for(auto a : s){
        t.insert(a);
    }
    if(t.search("yahoo")){
        cout<<"Found\n";
    }
    else{
        cout<<"Not Found\n";
    }
    return 0;
}