第九周项目二二叉数遍历的递归算法
来源:互联网 发布:海量数据下载 编辑:程序博客网 时间:2024/06/06 02:07
头文件btree.h:
- #ifndef BTREE_H_INCLUDED
- #define BTREE_H_INCLUDED
- #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);
- #endif // BTREE_H_INCLUDED
源文件btree.cpp:
- #include <stdio.h>
- #include <malloc.h>
- #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 "btree.h"
- void PreOrder(BTNode *b)
- {
- if (b!=NULL)
- {
- printf("%c ",b->data);
- PreOrder(b->lchild);
- PreOrder(b->rchild);
- }
- }
-
-
- void InOrder(BTNode *b)
- {
- if (b!=NULL)
- {
- InOrder(b->lchild);
- printf("%c ",b->data);
- InOrder(b->rchild);
- }
- }
-
-
- void PostOrder(BTNode *b)
- {
- if (b!=NULL)
- {
- PostOrder(b->lchild);
- PostOrder(b->rchild);
- printf("%c ",b->data);
- }
- }
-
-
- int main()
- {
- BTNode *b;
- CreateBTNode(b,"A(B(D,E(H(J,K(L,M(,N))))),C(F,G(,I)))");
- printf("二叉树b:");
- DispBTNode(b);
- printf("\n");
- printf("先序遍历序列:\n");
- PreOrder(b);
- printf("\n");
- printf("中序遍历序列:\n");
- InOrder(b);
- printf("\n");
- printf("后序遍历序列:\n");
- PostOrder(b);
- printf("\n");
- DestroyBTNode(b);
- return 0;
- }