（三叉字典树）二叉树套字典树

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<cmath>
#include<string>
using namespace std;
typedef struct Node
{
char ch;
int count;
Node *lson, *rson, *subtree;
}Node ,*Nodelink;

Nodelink create(char ch)
{
Nodelink p = new Node;
p->ch = ch;
p->lson = NULL;
p->rson = NULL;
p->subtree = NULL;
p->count = 0;
return p;
}
Nodelink root = create('\0');
void insert(char str[])
{
int i;
Nodelink p = root;
for(i = 0; i < strlen(str); i++)
{
if(p->subtree == NULL)p->subtree = create('str[i]');
p = p->subtree;
while(p->ch != str[i])
{
if(str[i] < p->ch)
{
if(p->lson == NULL)p->lson = create(str[i]);
p = p->lson;
}
else
{
if(p->rson == NULL)p->rson = create(str[i]);
p = p->rson;
}
}

}
p->count ++;
}
char pp[44];
void dfs(int top, Nodelink p)
{
int i;
if(p->lson != NULL)
dfs(top, p->lson);
pp[top] = p->ch;
for(i = 0; i < p->count; i++)
{
pp[top + 1] = '\0';
printf("%s\n", pp);
}
if(p->subtree != NULL)
dfs(top + 1, p->subtree);
if(p->rson != NULL)
dfs(top, p->rson);
}
Nodelink destroy(Nodelink p)
{
if(p->lson != NULL)
p->lson = destroy(p->lson);
if(p->subtree != NULL)
p->subtree = destroy(p->subtree);
if(p->rson != NULL)
p->rson = destroy(p->rson);
delete p;
return NULL;

}
int main()
{
char str[33];
freopen("test.in", "r", stdin);
while(~scanf("%s", str))
{
insert(str);
}
dfs(0, root);
destroy(root);
return 0;
}