DS哈希查找--Trie树

#include<iostream>
#include<sstream>
#include<vector>
#include<queue>
using namespace std;
struct Node{
    Node*next[26]={NULL};
};
class Trie{
    Node*root=new Node;
public:
    Trie(){
        string data;
        getline(cin, data);
        stringstream turn(data);
        while(turn >> data){
            int i=0;
            Node*current=root;
            while(i<data.size()&&current->next[data[i]-'a']){
                current=current->next[data[i]-'a'];
                i++;
            }
            for(;i<data.size();i++){
                Node*newOne=new Node;
                current=current->next[data[i]-'a']=newOne;
            }
        }
        BFS();
        int t;
        cin>>t;
        while(t--){
            cin>>data;
            Find(data);
        }
    }
    void BFS(){
        queue<Node*>open;
        open.push(root);
        while(!open.empty()){
            Node*current=open.front();
            open.pop();
            for(int i=0;i<26;i++)
                if(current->next[i]){
                    cout<<char(i+'a');
                    open.push(current->next[i]);
                }
        }
        cout<<endl;
    }
    void DFS(Node*current,int&count){
        bool leave=true;
        for(int i=0;i<26;i++)
            if(current->next[i]){
                leave= false;
                break;
            }
        if(leave){
            count++;
            return;
        }
        for(int i=0;i<26;i++)
            if(current->next[i])
                DFS(current->next[i],count);
    }
    void Find(string&data){
        Node*current=root;
        int i=0,count=0;
        while(i<data.size()&&current->next[data[i]-'a']){
            current=current->next[data[i]-'a'];
            i++;
        }
        if(i==data.size()){
            for(int j=0;j<26;j++)
                if(current->next[j])
                    DFS(current->next[j],count);
            cout<<count<<endl;
        }else cout<<'0'<<endl;
    }
};
int main() {
    Trie test;
    return 0;
}