c语言利用遍历求树高的程序,[原创]用C语言写的求二叉树的建立,前中后遍历,深度以及结点个数的程序...

[原创]用C语言写的求二叉树的建立,前中后遍历,深度以及结点个数的程序

#include

#include

#define MaxSize 100

typedef char ElemType;

typedef struct node

{

ElemType data;

struct node *left,*right;

} BTree;

void creatree(BTree **BT,char *str)

{

BTree *stack[MaxSize],*p;

int top=-1,k,j=0;/*top为栈指针,k指定是左还是右孩子,j为str指针*/

char ch;

*BT=NULL;

ch=str[j];

while (ch!='\0')

{

switch(ch)

{

case '(':top++;stack[top]=p;k=1; /*为左结点*/

break;

case ')':top--;

break;

case ',':k=2; /*为右结点*/

break;

default: p=(BTree *)malloc(sizeof(BTree));

p->data=ch;p->left=p->right=NULL;

if (*BT==NULL) /*根结点*/

*BT=p;

else

{

switch(k)

{

case 1:stack[top]->left=p;

break;

case 2:stack[top]->right=p;

}

}

}

j++;

ch=str[j];

}

}

void preorder(BTree *BT)

{

if (BT!=NULL)

{

printf("%c",BT->data);

preorder(BT->left);

preorder(BT->right);

}

}

void inorder(BTree *BT)

{

if (BT!=NULL)

{

inorder(BT->left);

printf("%c",BT->data);

inorder(BT->right);

}

}

void postorder(BTree *B)

{

if (B!=NULL)

{

postorder(B->left);

postorder(B->right);

printf("%c",B->data);

}

}

int BTreeDepth(BTree *B)

{

int leftdep,rightdep;

if (B==NULL)

return(0);

else

{

leftdep=BTreeDepth(B->left);

rightdep=BTreeDepth(B->right);

if (leftdep>rightdep)

return(leftdep+1);

else

return(rightdep+1);

}

}

int leafcount(BTree *B)

{

if (B==NULL)

return(0);

else if (B->left==NULL && B->right==NULL)

return(1);

else

return(leafcount(B->left)+leafcount(B->right));

}

main()

{

BTree *B;

char *s="A(B(D,E(H,I)),C(G))";

creatree(&B,s);

printf("\n前序遍历:");

preorder(B);

printf("\n中序遍历:");

inorder(B);

printf("\n后序遍历:");

postorder(B);

printf("\nthe deepth is%d\n",BTreeDepth(B));

printf("the leafcount is %d\n",leafcount(B));

}

谢谢曾经给我的提示,以后希望大家一起努力!!!!!