程序博客网 > 在台湾可以用淘宝吗

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

来源：互联网 发布：在台湾可以用淘宝吗 编辑：程序博客网 时间：2024/05/20 03:45

TreeNode.h:

[csharp] viewplaincopyprint?
  2. #define N 50
  4. typedef structstudent
  5. {
  6. charname[N];
  7. charstudentID[N];
  8. charbrithday[N];
  9. chartele[N];
  10. }TreeData;
  12. typedef structtreenode
  13. {
  14. TreeData * stuinfo;
  15. structtreenode *leftchild;
  16. structtreenode *rightchild;
  17. }TREENODE;
#define N 50typedef 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] viewplaincopyprint?
  2. #include<stdio.h>
  3. #include<string.h>
  4. #include<stdlib.h>
  5. #include"Treenode.h"
  7. externTREENODE *mycreatetree();
  8. externvoidmyinsertnode(TREENODE *,TreeData *);
  9. externvoidmycopy(TreeData *,char*,char*,char*,char*);
  10. externvoidmyeva(TreeData *);
  11. externvoidpreorder(TREENODE *);
  12. externTREENODE*treeinit(TREENODE *);
  13. externTREENODE *mysearch(TREENODE *,char*);
  14. externintisfind(TREENODE *,char*);
  15. externintmycorrect(TREENODE *,char*);
  16. externTREENODE *findleaf(TREENODE *);
  17. externTREENODE *findparent(TREENODE *,TREENODE *);
  18. externvoidmyremove(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] viewplaincopyprint?
  2. #include "Addressbook.h"
  4. void myeva(TreeData*dest)
  5. {
  6. printf("请输入你要添加的姓名:");
  7. scanf("%s",dest->name);
  8. while(1)
  9. {
  10. printf("请输入你要添加的学号(20209XXXX):");
  11. scanf("%s",dest->studentID);
  12. 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')))
  13. {
  14. break;
  15. }
  16. else
  17. {
  18. printf("输入有误！\n");
  19. printf("您输入的数据必须为20209XXXX的格式(XXXX为可变数)\n");
  20. }
  21. }
  22. while(1)
  23. {
  24. printf("请输入你要添加的生日(XXXX-XX-XX):");
  25. scanf("%s",dest->brithday);
  26. 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')))
  27. {
  28. if(dest->brithday[5]=='1')
  29. {
  30. if(dest->brithday[6]<='2')
  31. {
  32. ;
  33. }
  34. else
  35. {
  36. gotoloop;
  37. }
  38. }
  39. if(dest->brithday[8]=='3')
  40. {
  41. if(dest->brithday[9]<='1')
  42. {
  43. ;
  44. }
  45. else
  46. {
  47. gotoloop;
  48. }
  49. }
  50. break;
  51. }
  52. else
  53. {
  54. loop:
  55. printf("输入有误！\n");
  56. printf("您输入的数据必须为XXXX-XX-XX的格式\n");
  57. }
  58. }
  59. while(1)
  60. {
  61. printf("请输入你要添加的电话:");
  62. scanf("%s",dest->tele);
  63. if((strlen(dest->tele)==11)&&((dest->tele[0]<='9')&&(dest->tele[0]>='0'))&&((dest->tele[1]<='9')&&(dest->tele[1]>='0'))&&((dest->tele[2]<='9')&&(dest->tele[2]>='0'))&&((dest->tele[3]<='9')&&(dest->tele[3]>='0'))&&((dest->tele[4]<='9')&&(dest->tele[4]>='0'))&&((dest->tele[5]<='9')&&(dest->tele[5]>='0'))&&((dest->tele[6]<'9')&&(dest->tele[6]>='0'))&&((dest->tele[7]<='9')&&(dest->tele[7]>='0'))&&((dest->tele[8]<='9')&&(dest->tele[8]>='0'))&&((dest->tele[9]<='9')&&(dest->tele[9]>='0'))&&((dest->tele[10]<='9')&&(dest->tele[10]>='0')))
  64. {
  65. break;
  66. }
  67. else
  68. {
  69. printf("输入有误！\n");
  70. printf("您输入的数据必须为11位数字！\n");
  71. }
  72. }
  73. }
  75. void mycopy(TreeData*dest,char*name,char*studentID,char*brithday,char*tele)
  76. {
  77. strcpy(dest->name,name);
  78. strcpy(dest->studentID,studentID);
  79. strcpy(dest->brithday,brithday);
  80. strcpy(dest->tele,tele);
  81. }
  83. TREENODE * findleaf(TREENODE*root)
  84. {
  85. staticTREENODE * leaf =NULL;
  86. if(root != NULL)
  87. {
  88. if((root->leftchild== NULL) &&(root->rightchild == NULL))
  89. {
  90. leaf = root;
  91. returnleaf;
  92. }
  93. findleaf(root->leftchild);
  94. findleaf(root->rightchild);
  95. }
  96. returnleaf;
  97. }
  99. TREENODE *findparent(TREENODE *root,TREENODE*leaf)
  100. {
  101. staticTREENODE *parent =NULL;
  102. if(root->leftchild!= NULL)
  103. {
  104. if(root->leftchild== leaf)
  105. {
  106. parent = root;
  107. }
  108. else
  109. {
  110. findparent(root->leftchild,leaf);
  111. }
  112. }
  113. if(root->rightchild!= NULL)
  114. {
  115. if(root->rightchild== leaf)
  116. {
  117. parent = root;
  118. }
  119. else
  120. {
  121. findparent(root->rightchild,leaf);
  122. }
  123. }
  124. returnparent;
  125. }
  127. void myremove(TREENODE*root,char*info)
  128. {
  129. TREENODE *find = (TREENODE*)malloc(sizeof(TREENODE));
  130. TREENODE *leaf = (TREENODE *)malloc(sizeof(TREENODE));
  131. TREENODE *parent = (TREENODE*)malloc(sizeof(TREENODE));
  132. int ret =isfind(root,info);
  133. if(ret ==0)
  134. {
  135. printf("没有此人！\n");
  136. }
  137. else
  138. {
  139. find = mysearch(root,info);
  140. printf("确定要删除此学生:\n");
  141. printf("确定/取消？(Y/N):");
  142. char yn;
  143. setbuf(stdin,NULL);
  144. scanf("%c",&yn);
  145. if(yn =='Y')
  146. {
  147. leaf = findleaf(root);
  148. parent = findparent(root,leaf);
  149. if(leaf == find)
  150. {
  151. free(find);
  152. if(parent->leftchild== leaf)
  153. {
  154. parent->leftchild = NULL;
  155. }
  156. else
  157. {
  158. parent->rightchild = NULL;
  159. }
  160. find = NULL;
  161. }
  162. else
  163. {
  164. strcpy(find->stuinfo->name,leaf->stuinfo->name);
  165. strcpy(find->stuinfo->studentID,leaf->stuinfo->studentID);
  166. strcpy(find->stuinfo->brithday,leaf->stuinfo->brithday);
  167. strcpy(find->stuinfo->tele,leaf->stuinfo->tele);
  168. free(leaf);
  169. if(parent->leftchild== leaf)
  170. {
  171. parent->leftchild =NULL;
  172. }
  173. else
  174. {
  175. parent->rightchild =NULL;
  176. }
  177. leaf = NULL;
  178. }
  179. }
  180. }
  181. }
  182. TREENODE * mycreatetree()
  183. {
  184. TREENODE *root = NULL;
  185. returnroot;
  186. }
  188. void myinsertnode(TREENODE*root,TreeData *data)
  189. {
  190. if(strcmp(root->stuinfo->studentID,data->studentID)< 0)
  191. {
  192. if(root->leftchild== NULL)
  193. {
  194. TREENODE *new= (TREENODE*)malloc(sizeof(TREENODE));
  195. new->stuinfo= data;
  196. new->leftchild= NULL;
  197. new->rightchild= NULL;
  198. root->leftchild = new;
  199. }
  200. else
  201. {
  202. myinsertnode(root->leftchild,data);
  203. }
  204. }
  205. else
  206. {
  207. if(root->rightchild== NULL)
  208. {
  209. TREENODE *new= (TREENODE *)malloc(sizeof(TREENODE));
  210. new->stuinfo= data;
  211. new->leftchild= NULL;
  212. new->rightchild= NULL;
  213. root->rightchild =new;
  214. }
  215. else
  216. {
  217. myinsertnode(root->rightchild,data);
  218. }
  219. }
  220. }
  222. void preorder(TREENODE*root)
  223. {
  224. if(root !=NULL)
  225. {
  226. printf("姓名:%s\t学号:%s\t生日:%s\t电话:%s\n",root->stuinfo->name,root->stuinfo->studentID,root->stuinfo->brithday,root->stuinfo->tele);
  227. preorder(root->leftchild);
  228. preorder(root->rightchild);
  229. }
  230. }
  232. int isfind(TREENODE*root,char*info)
  233. {
  234. return((root != NULL)&&((strcmp(root->stuinfo->name,info) ==0) || (isfind(root->leftchild,info) ||isfind(root->rightchild,info))));
  235. }
  237. TREENODE * mysearch(TREENODE *root,char*info)
  238. {
  239. int ret =isfind(root,info);
  240. staticintflt = 0;
  241. staticTREENODE *find =NULL;
  242. if((ret == 0)&& (flt == 0))
  243. {
  244. printf("系统为找到此人！\n");
  245. return;
  246. }
  247. else
  248. {
  249. flt = 1;
  250. if(root !=NULL)
  251. {
  252. if(strcmp(root->stuinfo->name,info)== 0)
  253. {
  254. find = root;
  255. printf("姓名:%s\t学号:%s\t生日:%s\t电话:%s\n",root->stuinfo->name,root->stuinfo->studentID,root->stuinfo->brithday,root->stuinfo->tele);
  256. returnfind;
  257. }
  258. mysearch(root->leftchild,info);
  259. mysearch(root->rightchild,info);
  260. }
  261. }
  262. returnfind;
  263. }
  265. int mycorrect(TREENODE*root,char*info)
  266. {
  267. int ret =isfind(root,info);
  268. staticintflt = 0;
  269. if((ret == 0)&& (flt == 0))
  270. {
  271. printf("系统为找到此人！\n");
  272. printf("请按Enter键继续...");
  273. getchar();
  274. getchar();
  275. return;
  276. }
  277. else
  278. {
  279. flt = 1;
  280. if(root !=NULL)
  281. {
  282. if(strcmp(root->stuinfo->name,info)== 0)
  283. {
  284. printf("姓名:%s\t学号:%s\t生日:%s\t电话:%s\n",root->stuinfo->name,root->stuinfo->studentID,root->stuinfo->brithday,root->stuinfo->tele);
  285. printf("\n");
  286. printf("\n");
  287. printf("\n");
  288. printf("\n");
  289. printf("\n");
  290. printf("\n");
  291. printf("\n");
  292. intchoose;
  293. char yn;
  294. char *buffer =(char*)malloc(sizeof(char));
  295. printf("请输入你想修改的内容或按5取消修改:");
  296. scanf("%d",&choose);
  297. while((choose> 5) || (choose <1))
  298. {
  299. printf("输入有误！\n");
  300. printf("请重新输入要修改的内容或按5取消:");
  301. scanf("%d",&choose);
  302. }
  303. switch(choose)
  304. {
  305. case 1:
  306. {
  307. printf("请输入要新的姓名:");
  308. scanf("%s",buffer);
  309. printf("您确定要将%s更改为%s吗？(Y/N):",root->stuinfo->name,buffer);
  310. setbuf(stdin,NULL);
  311. scanf("%c",&yn);
  312. if(yn =='Y')
  313. {
  314. strcpy(root->stuinfo->name,buffer);
  315. printf("修改成功\n");
  316. printf("请按Enter键继续...");
  317. setbuf(stdin,NULL);
  318. getchar();
  319. getchar();
  320. }
  321. else
  322. {
  323. printf("数据没有修改！\n");
  324. printf("请按Enter键继续...");
  325. setbuf(stdin,NULL);
  326. getchar();
  327. getchar();
  328. }
  329. break;
  330. }
  331. case 2:
  332. {
  333. printf("请输入要新的学号:");
  334. scanf("%s",buffer);
  335. printf("您确定要将%s更改为%s吗？(Y/N):",root->stuinfo->studentID,buffer);
  336. setbuf(stdin,NULL);
  337. scanf("%c",&yn);
  338. if(yn =='Y')
  339. {
  340. strcpy(root->stuinfo->studentID,buffer);
  341. printf("修改成功\n");
  342. printf("请按Enter键继续...");
  343. setbuf(stdin,NULL);
  344. getchar();
  345. getchar();
  346. }
  347. else
  348. {
  349. printf("数据没有修改！\n");
  350. printf("请按Enter键继续...");
  351. setbuf(stdin,NULL);
  352. getchar();
  353. getchar();
  354. }
  355. break;
  356. }
  357. case 3:
  358. {
  359. printf("请输入要新的生日:");
  360. scanf("%s",buffer);
  361. printf("您确定要将%s更改为%s吗？(Y/N):",root->stuinfo->brithday,buffer);
  362. setbuf(stdin,NULL);
  363. scanf("%c",&yn);
  364. if(yn =='Y')
  365. {
  366. strcpy(root->stuinfo->brithday,buffer);
  367. printf("修改成功\n");
  368. printf("请按Enter键继续...");
  369. setbuf(stdin,NULL);
  370. getchar();
  371. getchar();
  372. }
  373. else
  374. {
  375. printf("数据没有修改！\n");
  376. printf("请按Enter键继续...");
  377. setbuf(stdin,NULL);
  378. getchar();
  379. getchar();
  380. }
  381. break;
  382. }
  383. case 4:
  384. {
  385. printf("请输入要新的电话:");
  386. scanf("%s",buffer);
  387. printf("您确定要将%s更改为%s吗?(Y/N):",root->stuinfo->tele,buffer);
  388. setbuf(stdin,NULL);
  389. scanf("%c",&yn);
  390. if(yn =='Y')
  391. {
  392. strcpy(root->stuinfo->tele,buffer);
  393. printf("修改成功\n");
  394. printf("请按Enter键继续...");
  395. getchar();
  396. getchar();
  397. }
  398. else
  399. {
  400. printf("数据没有修改！\n");
  401. printf("请按Enter键继续...");
  402. setbuf(stdin,NULL);
  403. getchar();
  404. getchar();
  405. }
  406. break;
  407. }
  408. case 5:
  409. {
  410. break;
  411. }
  412. }//switend
  413. goto end;
  414. } //if==end
  415. mycorrect(root->leftchild,info);
  416. mycorrect(root->rightchild,info);
  417. } // if==NULLend
  418. } //elseend
  419. end:
  420. return;
  421. }
  423. void display(TREENODE*root)
  424. {
  425. intchoose;
  426. system("clear");
  427. printf("\n\n\n\n\n\n\n\n\n\n\n");
  428. printf("\t\t\t欢迎使用通讯录管理系统！\n");
  429. printf("\n\n\n\n\n\n\n\n\n\n\n");
  430. sleep(2);
  431. system("clear");
  432. while(1)
  433. {
  434. system("clear");
  435. printf("\n");
  436. printf("\n");
  437. printf("\n");
  438. printf("\n");
  439. printf("\n");
  440. printf("\n");
  441. printf("\n");
  442. printf("\n");
  443. printf("请输入您的选择(1-6):");
  444. scanf("%d",&choose);
  445. if((choose >6) || (choose < 1))
  446. {
  447. printf("输入有误，您的选择必须在1-5之间！\n");
  448. printf("请重新输入:");
  449. scanf("%d",&choose);
  450. }
  451. switch(choose)
  452. {
  453. case 1:
  454. {
  455. system("clear");
  456. preorder(root);
  457. printf("请按Enter键继续...");
  458. setbuf(stdin,NULL);
  459. getchar();
  460. break;
  461. }
  462. case 2:
  463. {
  464. system("clear");
  465. char *info =(char*)malloc(sizeof(char));
  466. printf("请输入要修改的人的姓名:");
  467. scanf("%s",info);
  468. mycorrect(root,info);
  469. break;
  470. }
  471. case 3:
  472. {
  473. system("clear");
  474. TreeData *info = (TreeData*)malloc(sizeof(TreeData));
  475. myeva(info);
  476. printf("您确定要添加学生:\n");
  477. printf("姓名:%s\t学号:%s\t生日:%s\t电话:%s\n",info->name,info->studentID,info->brithday,info->tele);
  478. printf("确定/取消(Y/N)？");
  479. char yn;
  480. setbuf(stdin,NULL);
  481. scanf("%c",&yn);
  482. if(yn =='Y')
  483. {
  484. if(root ==NULL)
  485. {
  486. root = (TREENODE *)malloc(sizeof(TREENODE));
  487. root->stuinfo = info;
  488. root->leftchild =NULL;
  489. root->rightchild = NULL;
  490. }
  491. else
  492. {
  493. myinsertnode(root,info);
  494. }
  495. printf("添加成功！\n");
  496. }
  497. else
  498. {
  499. printf("取消添加！\n");
  500. }
  501. printf("请按Enter键继续...");
  502. getchar();
  503. getchar();
  504. break;
  505. }
  506. case 4:
  507. {
  508. system("clear");
  509. char *info =(char*)malloc(sizeof(char));
  510. printf("请输入要查找的人的姓名:");
  511. scanf("%s",info);
  512. mysearch(root,info);
  513. printf("请按Enter键继续...");
  514. setbuf(stdin,NULL);
  515. getchar();
  516. break;
  517. }
  518. case 5:
  519. {
  520. system("clear");
  521. char *info =(char*)malloc(sizeof(char));
  522. printf("请输入要删除的人的姓名:");
  523. scanf("%s",info);
  524. myremove(root,info);
  525. printf("请按Enter键继续...");
  526. getchar();
  527. getchar();
  528. break;
  529. }
  530. case 6:
  531. {
  532. system("clear");
  533. printf("\n\n\n\n\n\n\n\n\n\n\n");
  534. printf("\t\t\t\t欢迎再次使用！\n");
  535. printf("\n\n\n\n\n\n\n\n\n\n\n");
  536. sleep(2);
  537. system("clear");
  538. exit(0);
  539. }
  540. default:
  541. {
  542. ;
  543. }
  544. }
  545. }
  546. }
  548. TREENODE * treeinit(TREENODE *root)
  549. {
  550. TreeData * info[4];
  551. int i;
  552. for(i = 0; i< 4; i++)
  553. {
  554. if((info[i] = (TreeData*)malloc(sizeof(TreeData))) ==NULL)
  555. {
  556. printf("分配空间失败！\n");
  557. }
  558. }
  559. mycopy(info[0],"张一","202090116","1990-10-11","15298377000");
  560. mycopy(info[1],"张二","202090114","1990-10-12","15298377111");
  561. mycopy(info[2],"张三","202090115","1990-10-13","15298377222");
  562. mycopy(info[3],"张四","202090118","1990-10-14","15298377333");
  563. root = (TREENODE *)malloc(sizeof(TREENODE));
  564. root->stuinfo =info[0];
  565. root->leftchild = NULL;
  566. root->rightchild =NULL;
  567. myinsertnode(root,info[1]);
  568. myinsertnode(root,info[2]);
  569. myinsertnode(root,info[3]);
  570. returnroot;
  571. }
  573. intmain()
  574. {
  575. TREENODE * root = NULL;
  576. root = mycreatetree();
  577. root = treeinit(root);
  578. display(root);
  579. return0;
  580. }
在台湾可以用淘宝吗 在台湾可以用淘宝吗
原创粉丝点击
热门IT博客
js onmousemovejs onmousemove
文泰刻绘软件下载文泰刻绘软件下载
qq网络硬盘找不到了
js控制audio播放
农村淘宝合伙人召集令
江西警方抓获网络诈骗
java全角半角转换
python is empty
单片机步进电机c程序
中文字体下载for mac
什么是淘宝黑车
安卓4.4 联系人数据库
联通怎么开通4g网络
星际皆知你爱我txt下载
js 处理json对象
python 如何读入文件
淘宝网稻草人男包
手机乐斗过程优化
java mq消息队列
淘宝店铺售假扣26分
热门问题 老师的惩罚 人脸识别 我在镇武司摸鱼那些年 重生之率土为王 我在大康的咸鱼生活 盘龙之生命进化 天生仙种 凡人之先天五行 春回大明朝 姑娘不必设防，我是瞎子 检测仪表 约克仪表 天康仪表 星骋仪表 计量仪表 热工仪表 天信仪表 仪表校验仪 小车仪表 仪器仪表展 蓝鸟仪表 仪表控制箱 傲虎仪表 lufi仪表 分析仪表 汽车仪表盘故障图标大全大图 汽车仪表盘指示灯图解 仪表故障灯大全图 汽车仪表指示灯图解 仪表盘故障灯图解 仪表故障灯图解 汽车仪表盘图标大全 汽车仪表盘故障灯图解 汽车仪表故障灯图解 汽车仪表图标大全 仪表盘感叹号 车仪表盘指示灯图解 汽车仪表盘trip什么意思 大众仪表盘指示灯图解 仪表盘上指示灯图解 汽车仪表盘故障图标大全高清 货车仪表故障灯大全图 车辆仪表盘指示灯图解 汽车仪表灯图标解释 车仪表盘图标大全 仪表台所有指示灯图解 汽车仪表图标识别大全图片 仪表盘故障灯图解大全 车上仪表盘标志大全 柴油车仪表故障灯图解 货车仪表盘指示灯图解大全

程序博客网，程序员的互联网技术博客家园。csdn论坛精品 msdn技术资料都在这里