嵌入式一个简单的个人通讯录（基于二叉排序树，带注释）

本文链接：https://blog.csdn.net/skdkjzz/article/details/17073685

这是一个实现嵌入式个人通讯录的项目，使用二叉排序树作为数据结构。代码包括了数据结构定义、节点插入、删除、查找和遍历等操作。用户可以添加、修改、查找和删除联系人信息，所有输入信息都会进行合法性检查。

摘要由CSDN通过智能技术生成

TreeNode.h:

[csharp] viewplain copy print ?

#define N 50
typedef structstudent
{
charname[N];
charstudentID[N];
charbrithday[N];
chartele[N];
}TreeData;
typedef structtreenode
{
TreeData * stuinfo;
struct treenode *leftchild;
struct treenode *rightchild;
}TREENODE;

#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;

Addressbook.h:

[csharp] viewplain copy print ?

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include"Treenode.h"
extern TREENODE *mycreatetree();
extern voidmyinsertnode(TREENODE *,TreeData *);
extern voidmycopy(TreeData *,char*,char *,char*,char *);
extern voidmyeva(TreeData *);
extern voidpreorder(TREENODE *);
extern TREENODE*treeinit(TREENODE *);
extern TREENODE *mysearch(TREENODE *,char*);
extern intisfind(TREENODE *,char*);
extern intmycorrect(TREENODE *,char*);
extern TREENODE *findleaf(TREENODE *);
extern TREENODE *findparent(TREENODE *,TREENODE *);
extern voidmyremove(TREENODE *,char*);

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include "Treenode.h"

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 *);

Addressbook.c:

[csharp] viewplain copy print ?

#include "Addressbook.h"
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的格式(