第十周项目一
来源:互联网 发布:势不可挡网络剧预告片 编辑:程序博客网 时间:2024/05/17 07:43
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- #include <stdio.h>
- #define MaxSize 100
- typedef char ElemType;
-
- typedef struct node
- {
- ElemType data;
-
- struct node *lchild;
-
- struct node *rchild;
- }BTNode;
-
- typedef struct
- {
- BTNode *data[MaxSize];
-
- int front,rear;
-
- }SqQueue;
-
- void CreateBTNode(BTNode *&b,char *str);
- BTNode *FindNode(BTNode *b,ElemType x);
- BTNode *LchildNode(BTNode *p);
- BTNode *RchildNode(BTNode *p);
- int BTNodeDepth(BTNode *b);
- void DispBTNode(BTNode *b);
- void DestroyBTNode(BTNode *&b);
- void LevelOrder(BTNode *b);
-
-
-
-
- #include <malloc.h>
- #include <stdio.h>
- #include "btree2.h"
- void CreateBTNode(BTNode *&b,char *str)
- {
- BTNode *St[MaxSize],*p;
-
- int top=-1,k,j=0;
-
- char ch;
-
- b=NULL;
-
-
- ch=str[j];
-
- while(ch!='\0')
- {
- switch(ch)
- {
- case '(':top++;
- St[top]=p;
- k=1;
- break;
- case ')':
- top--;
- break;
- case ',':
- k=2;
- break;
- default:p=(BTNode*)malloc(sizeof(BTNode));
- p->data=ch;
- p->lchild=p->rchild=NULL;
- if(b==NULL)
- {
- b=p;
- }
- else
- {
- switch(k)
- {
- case 1:
- St[top]->lchild=p;
- break;
- case 2:
- St[top]->rchild=p;
- break;
- }
- }
- }
- j++;
- ch=str[j];
-
- }
- }
-
- void DestroyBTNode(BTNode *&b)
- {
- if(b!=NULL)
- {
- DestroyBTNode(b->lchild);
- DestroyBTNode(b->rchild);
- free(b);
-
- }
- }
-
- BTNode *FindNode(BTNode *b,ElemType x)
- {
- BTNode *p;
- if(b==NULL)
- {
- return NULL;
- }
- else if(b->data==x)
- return b;
- else
- {
- p=FindNode(b->lchild,x);
- if(p!=NULL)
- {
- return p;
- }
- else
- return FindNode(b->rchild,x);
- }
- }
-
- BTNode *LchildNode(BTNode *p)
- {
- return p->lchild;
- }
- BTNode *RchildNode(BTNode *p)
- {
- return p->rchild;
- }
-
- int BTNodeDepth(BTNode *b)
- {
- int lchildh;
-
- int rchildh;
-
- if(b==NULL)
- return 0;
- else
- {
- lchildh=BTNodeDepth(b->lchild);
- rchildh=BTNodeDepth(b->rchild);
- {
- if(lchildh>rchildh)
- {
- return lchildh+1;
- }
- else
- {
- return rchildh+1;
- }
- }
-
-
- }
- }
-
- void DispBTNode(BTNode *b)
- {
- if(b!=NULL)
- {
- printf("%c",b->data);
- if(b->lchild!=NULL || b->rchild!=NULL)
- {
- printf("(");
- DispBTNode(b->lchild);
- if(b->rchild!=NULL)
- {
- printf(",");
- DispBTNode(b->rchild);
- }
- printf(")");
-
- }
- }
- }
-
-
- void LevelOrder(BTNode *b)
- {
- BTNode *p;
-
- BTNode *qu[MaxSize];
-
- int front,rear;
-
- front=rear=-1;
-
- rear++;
-
- qu[rear]=b;
-
- while(front!=rear)
- {
- front=(front+1)%MaxSize;
- p=qu[front];
- printf("%c",p->data);
- if(p->lchild!=NULL)
- {
- rear=(rear+1)%MaxSize;
- qu[rear]=p->lchild;
- }
- if(p->rchild!=NULL)
- {
- rear=(rear+1)%MaxSize;
- qu[rear]=p->rchild;
- }
- }
- }
-
-
- #include <stdio.h>
- #include <malloc.h>
- #include "btree2.h"
-
- int main()
- {
- BTNode *p;
- CreateBTNode(p,"A(B(D,E(H(J,K(L,M(,N))))),C(F,G(,I)))");
- printf("输出二叉树\n");
- DispBTNode(p);
-
- printf("层次遍历,输出结果\n");
-
- LevelOrder(p);
-
- DestroyBTNode(p);
-
- return 0;
-
- }
运行结果:
学习心得:学会了层次算法遍历的应用。