#include <iostream>
#include <cstring>
using namespace std;
//树的结构体
typedef struct node{
char data[20];
struct node *left, *right;
}*ptree, pnode;
//搜索二叉树的根节点
ptree creategen(char c[])
{
ptree t;
t = (ptree)malloc(sizeof(pnode));
strcpy(t->data,c);
t->left = NULL;
t->right = NULL;
return t;
}
//创建搜索二叉树
void create(ptree root, char c[])
{
ptree temp, t;
t = root;
if (strcmp(t->data,c)==0)
{
printf("你所输入的元素已经存在:\n");
exit(1);
#include <cstring>
using namespace std;
//树的结构体
typedef struct node{
char data[20];
struct node *left, *right;
}*ptree, pnode;
//搜索二叉树的根节点
ptree creategen(char c[])
{
ptree t;
t = (ptree)malloc(sizeof(pnode));
strcpy(t->data,c);
t->left = NULL;
t->right = NULL;
return t;
}
//创建搜索二叉树
void create(ptree root, char c[])
{
ptree temp, t;
t = root;
if (strcmp(t->data,c)==0)
{
printf("你所输入的元素已经存在:\n");
exit(1);