第十一周项目1-验证二叉树算法(2)
来源:互联网 发布:lol断开连接请检查网络 编辑:程序博客网 时间:2024/05/24 06:33
btree.h:
- #include <stdio.h>
- #include <malloc.h>
- #define MaxSize 100
- typedef char ElemType;
- typedef struct node
- {
- ElemType data;
- struct node *lchild;
- struct node *rchild;
- } BTNode;
-
- 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);
btree.cpp:- #include "btree.h"
- void CreateBTNode(BTNode *&b,char *str)
- {
- BTNode *St[MaxSize],*p=NULL;
- 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];
- }
- }
- 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 lchilddep,rchilddep;
- if (b==NULL)
- return(0);
- else
- {
- lchilddep=BTNodeDepth(b->lchild);
- rchilddep=BTNodeDepth(b->rchild);
- return (lchilddep>rchilddep)? (lchilddep+1):(rchilddep+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 DestroyBTNode(BTNode *&b)
- {
- if (b!=NULL)
- {
- DestroyBTNode(b->lchild);
- DestroyBTNode(b->rchild);
- free(b);
- }
- }
main.cpp:
- #include <stdio.h>
- #include <malloc.h>
- #include "btree.h"
-
- BTNode *CreateBT1(char *pre,char *in,int n)
-
-
- {
- BTNode *s;
- char *p;
- int k;
- if (n<=0) return NULL;
- s=(BTNode *)malloc(sizeof(BTNode));
- s->data=*pre;
- for (p=in; p<in+n; p++)
- if (*p==*pre)
- break;
- k=p-in;
- s->lchild=CreateBT1(pre+1,in,k);
- s->rchild=CreateBT1(pre+k+1,p+1,n-k-1);
- return s;
- }
-
- int main()
- {
- ElemType pre[]="ABDGCEF",in[]="DGBAECF";
- BTNode *b1;
- b1=CreateBT1(pre,in,7);
- printf("b1:");
- DispBTNode(b1);
- printf("\n");
- return 0;
- }
main.cpp:
- #include <stdio.h>
- #include <malloc.h>
- #include "btree.h"
-
- BTNode *CreateBT2(char *post,char *in,int n)
-
-
- {
- BTNode *s;
- char r,*p;
- int k;
- if (n<=0) return NULL;
- r=*(post+n-1);
- s=(BTNode *)malloc(sizeof(BTNode));
- s->data=r;
- for (p=in; p<in+n; p++)
- if (*p==r)
- break;
- k=p-in;
- s->lchild=CreateBT2(post,in,k);
- s->rchild=CreateBT2(post+k,p+1,n-k-1);
- return s;
- }
-
- int main()
- {
- ElemType in[]="DGBAECF",post[]="GDBEFCA";
- BTNode *b2;
- b2=CreateBT2(post,in,7);
- printf("b2:");
- DispBTNode(b2);
- printf("\n");
- return 0;
- }
- #include <stdio.h>
- #include <malloc.h>
- #include "btree.h"
- #define N 30
- typedef ElemType SqBTree[N];
- BTNode *trans(SqBTree a,int i)
- {
- BTNode *b;
- if (i>N)
- return(NULL);
- if (a[i]=='#')
- return(NULL);
- b=(BTNode *)malloc(sizeof(BTNode));
- b->data=a[i];
- b->lchild=trans(a,2*i);
- b->rchild=trans(a,2*i+1);
- return(b);
- }
- int main()
- {
- BTNode *b;
- ElemType s[]="0ABCD#EF#G####################";
- b=trans(s,1);
- printf("b:");
- DispBTNode(b);
- printf("\n");
- return 0;
- }
0 0