01字典树模板

带删除01字典树，Query出来的值是字典树中异或出来的最大值

typedef long long ll;
const int maxn = 1e5+10;//数据范围
const int Bit = 32;//数转化成二进制的范围

int ch[maxn*Bit][2],cnt[maxn*Bit];
ll value[maxn*Bit];
int node_cnt;

inline void init(){
    node_cnt = 1;
    memset(ch[0],0,sizeof(ch));
}

inline void Insert(ll x,int f){
    int cur = 0;
    for(int i = 32;i >= 0;i--){
        int idx = (x >> i)&1;
        if(!ch[cur][idx]){
            memset(ch[node_cnt],0,sizeof(ch[node_cnt]));
            ch[cur][idx] = node_cnt;
            cnt[node_cnt] = 0;
            value[node_cnt++] = 0;
        }
        cur = ch[cur][idx];
        cnt[cur] += f;
    }
    value[cur] = x;
}

inline ll Query(ll x){
    int cur = 0;
    for(int i = 32;i >= 0;i--){
        int idx = (x>>i)&1;
        if(ch[cur][idx^1]&&cnt[ch[cur][idx^1]]) cur = ch[cur][idx^1];
        else cur = ch[cur][idx];
    }
    return value[cur]^x;
}

单纯的普通字典树（求前缀用）

#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <cstdio>
#include <vector>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>

using namespace std;
const int maxn = 1e6+10;

int le;
struct node{
    int Next[26];
    int cnt;
    void init(){
        cnt = 0;
        memset(Next,-1,sizeof(Next));
    }
}T[maxn];


void Insert(char *s){
    int i = 0,p = 0;
    while(s[i]){
        int x = s[i]-'a';
        if(T[p].Next[x] == -1){
            T[le].init();
            T[p].Next[x] = le++;
        }
        p = T[p].Next[x];
        T[p].cnt++;
        i++;
    }
}

void query(char *s){
    int i = 0,p = 0;
    while(s[i]){
        int x = s[i]-'a';
        if(T[p].Next[x] == -1){
            puts("0");
            return ;
        }
        p = T[p].Next[x];
        i++;
    }
    printf("%d\n",T[p].cnt);
}
//main函数里面记得先T[0].init();