嵌入式 二叉树实现通讯录管理系统

这篇博客介绍了一个使用二叉树数据结构实现的通讯录管理系统,包括添加、删除、查找和修改联系人信息的功能。通过严格的输入验证确保数据的正确性,并提供了前序遍历展示通讯录内容的方法。
摘要由CSDN通过智能技术生成

#define N 50

typedef struct student
{
char name[N];
char studentID[N];
char brithday[N];
char tele[N];
}TreeData;

typedef struct treenode
{
TreeData * stuinfo;
struct treenode * leftchild;
struct treenode * rightchild;
}TREENODE;

#include
#include
#include

extern TREENODE * mycreatetree();
extern void myinsertnode(TREENODE *,TreeData *);
extern void mycopy(TreeData *,char *,char *,char *,char *);
extern void myeva(TreeData *);
extern void preorder(TREENODE *);
extern TREENODE *treeinit(TREENODE *);
extern TREENODE * mysearch(TREENODE *,char *);
extern int isfind(TREENODE *,char *);
extern int mycorrect(TREENODE *,char *);
extern TREENODE * findleaf(TREENODE *);
extern TREENODE * findparent(TREENODE *,TREENODE *);
extern void myremove(TREENODE *,char *);

void myeva(TreeData *dest)
{
printf("请输入你要添加的姓名:");
scanf("%s",dest->name);
while(1)
{
printf("请输入你要添加的学号(20209XXXX):");
scanf("%s",dest->studentID);
if((strlen(dest->studentID) == 9) &&(dest->studentID[0] == '2')&& (dest->studentID[1] =='0')&& (dest->studentID[2] == '2')&&(dest->studentID[3] == '0')&& (dest->studentID[4] =='9')&&((dest->studentID[5] <='9')&&(dest->studentID[5] >='0'))&&((dest->studentID[6] <='9')&&(dest->studentID[6] >='0'))&&((dest->studentID[7] <='9')&&(dest->studentID[7] >='0'))&&((dest->studentID[8] <='9')&&(dest->studentID[8] >= '0')))
{
break;
}
else
{
printf("输入有误!\n");
printf("您输入的数据必须为20209XXXX的格式(XXXX为可变数)\n");
}
}
while(1)
{
printf("请输入你要添加的生日(XXXX-XX-XX):");
scanf("%s",dest->brithday);
if((strlen(dest->brithday) == 10) &&((dest->brithday[0] <= '9')&&(dest->brithday[0]>= '0'))&& ((dest->brithday[1] <='9')&&(dest->brithday[1] >= '0'))&&((dest->brithday[2] <= '9')&&(dest->brithday[2]>= '0'))&& ((dest->brithday[3] <='9')&&(dest->brithday[3] >= '0'))&&(dest->brithday[4] == '-')&&((dest->brithday[5] <='1')&&(dest->brithday[5] >='0'))&&((dest->brithday[6] <='9')&&(dest->brithday[6] >='0'))&&(dest->brithday[7] =='-')&&((dest->brithday[8] <='3')&&(dest->brithday[8] >='0'))&&((dest->brithday[9] <='9')&&(dest->brithday[9] >= '0')))
{
if(dest->brithday[5] == '1')
{
if(dest->brithday[6] <= '2')
{
;
}
else
{
goto loop;
}
}
if(dest->brithday[8] == '3')
{
if(dest->brithday[9] <= '1')
{
;
}
else
{
goto loop;
}
}
break;
}
else
{
loop:
printf("输入有误!\n");
printf("您输入的数据必须为XXXX-XX-XX的格式\n");
}
}
whi

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值