用C语言创建二叉树并先序遍历.doc

《用C语言创建二叉树并先序遍历.doc》由会员上传分享，免费在线阅读，更多相关内容在工程资料-天天文库。

1、用C语言创建二叉树并先序遍历程序制作：FEITK#include"stdio.h"#include"stdlib.h"typedefstructnode{chardata;structnode*lchild,*rchild;}BT;BT*CreateBT(){BT*q,*s[30];inti,j;charx;printf("请输入二叉树的节点编号和节点数据（例：1,A）注意：结束输入时节点编号输入0,节点数据任意！");printf("编号,数据:");scanf("%d,%c",&i,&x);while(i!=0){q=(BT*)malloc

2、(sizeof(BT));q->data=x;q->lchild=NULL;q->rchild=NULL;s[i]=q;if(i!=1){j=i/2;if(i%2==0)s[j]->lchild=q;elses[j]->rchild=q;}printf("编号,数据:");scanf("%d,%c",&i,&x);}returns[1];}voidPreorder(BT*bt)/*先序遍历*/{if(bt!=NULL){printf("%c",bt->data);Preorder(bt->lchild);Preorder(bt->rchild);}}voidPre

3、order2(BT*bt)/*先序遍历度为2的节点*/{if(bt!=NULL){if(bt->lchild!=NULL&&bt->rchild!=NULL){printf("%c",bt->data);Preorder2(bt->lchild);Preorder2(bt->rchild);}}}voidPreorder1(BT*bt)/*先序遍历度为1的节点*/{if(bt!=NULL){if((bt->lchild==NULL&&bt->rchild!=NULL)

4、

5、(bt->lchild!=NULL&&bt->rchild==NULL))printf("%c

6、",bt->data);else{Preorder1(bt->lchild);Preorder1(bt->rchild);}}}voidPreorder0(BT*bt)/*先序遍历度为0的节点*/{if(bt!=NULL){if(bt->lchild==NULL&&bt->rchild==NULL)printf("%c",bt->data);else{Preorder0(bt->lchild);Preorder0(bt->rchild);}}}main(){BT*bt=CreateBT();printf("先序遍历输出所有节点:");Preorder(bt

7、);printf("");printf("先序遍历输出所有度为2的节点:");Preorder2(bt);printf("");printf("先序遍历输出所有度为1节点:");Preorder1(bt);printf("");printf("先序遍历输出所有度为0节点:");Preorder0(bt);printf("");system("pause");}