二叉树的一些操作

1、#include #include #include #define OVERFLOW 0#define OK 1#define NULL 0#define Max 100typedef int Status ;typedef char TElemType;typedef struct BiTNode / 结点结构TElemType data;struct BiTNode *lchild, *rchild;/ 左右孩子指针 BiTNode, *BiTree;Status CreateBiTree (BiTree &T)char ch; scanf(%c,&ch) ;if(ch=#)T=NULL

2、;elseif(!(T=(BiTNode *)malloc(sizeof(BiTNode)exit(OVERFLOW);/生成根结点/构造左子树/生成根结点/构造左子树/构造右子树CreateBiTree( T-lchild);CreateBiTree( T-rchild);return OK; / CreateBiTreevoid Preorder (BiTree T) / 先序遍历二叉树if (T) printf(%c,T-data); / 访问结点Preorder(T-lchild); / 遍历左子树Preorder(T-rchild);/ 遍历右子树typedef structBiTr

3、ee stackMax;int top; SqStack;void Initstack(SqStack *s) / s=(SqStack *)malloc(Max*sizeof(elemtype); s-top=-1;int EmptyStack(SqStack s)if (s.top=-1) return 1;else return 0;void push(SqStack *s,BiTree e)(*s).top+;(*s).stack(*s).top=e;BiTree pop(SqStack *s)BiTree x;x=s-stacks-top;s-top-;return x;Status

4、 InorderTraverse(BiTree T)BiTree p;SqStack S;Initstack(&S);p=T;while(p|!EmptyStack(S)while (p)push(&S,p);p=p-lchild;if(!EmptyStack(S)p=pop(&S);printf(%c,p-data);p=p-rchild;return OK;void Postreorder (BiTree T) / 后序遍历二叉树if (T) Postreorder(T-lchild);/ 遍历左子树Postreorder(T-rchild);/ 遍历右子树printf(%c,T-data

5、); / 访问结点void CountLeaf (BiTree T, int& count)if ( T ) if (!T-lchild)& (!T-rchild)count+; / 对叶子结点计数CountLeaf( T-lchild, count);CountLeaf( T-rchild, count); / if / CountLeafint Depth (BiTree T ) / 返回二叉树的深度int depthval,depthLeft,depthRight;if ( !T )depthval = 0;elsedepthLeft = Depth( T-lchild );depthR

6、ight= Depth( T-rchild );depthval = 1 + (depthLeft depthRight ?depthLeft : depthRight); return depthval;int main()int count=0;BiTree q;printf(”请输入树，若无孩子结点用#代替:n);CreateBiTree(q);printf(先序遍历结果为：n);Preorder(q);printf(n);printf(冲序遍历结果为:n”);InorderTraverse(q);printf(n);printf(”后序遍历结果为：n);Postreorder(q);printf(n);CountLeaf(q,count);printf( 叶子节点个