BinaryTree.h
#ifndef BINARYTREE_H_INCLUDED
#define BINARYTREE_H_INCLUDED
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdbool.h>
#define MaxSize 100
typedef char ElemType;
typedef struct node
{
ElemType data;
struct node *lchild,*rchild;//左子树,右子树
} BTNode;
void CreateBTNode(BTNode **b,char *str);
BTNode *FindNode(BTNode *b,ElemType x);//查找
int BTNodeDepth(BTNode *b);
void DispBTNode(BTNode *b);//输出二叉树
BTNode *LchildNode(BTNode *p);
BTNode *RchildNode(BTNode *p);
//递归遍历
void PreOrder(BTNode *b);
void InOrder(BTNode *b);
void PostOrder(BTNode *b);
//非递归遍历
void PreOrder1(BTNode *b);
void InOrder1(BTNode *b);
void PostOrder1(BTNode *b);
//层序遍历
void LevelOrder(BTNode *b);
#endif // BINARYTREE_H_INCLUDED
BinaryTree.c
#include "BinaryTree.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) //p为二叉树的根
(*b)=p;
else //p要作为已建立的二叉树的子树
{
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);
}
}
//求出高度
int BTNodeDepth(BTNode *b)
{
int lchilddep,rchilddep;
if (b==NULL)
return(0); //空树的高度为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(")");
}
}
}
//得到左节点
BTNode *LchildNode(BTNode *p)
{
return p->lchild;
}
//得到右节点
BTNode *RchildNode(BTNode *p)
{
return p->rchild;
}
//递归前序
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);
}
}
//非递归先序
void PreOrder1(BTNode *b)
{
BTNode *St[MaxSize],*p;
int top=-1;
top++;
St[top]=b; //根节点入栈
while (top>-1) //栈不为空时循环
{
p=St[top]; //退栈并访问该节点
top--;
printf("%c ",p->data);
if (p->rchild!=NULL) //右孩子节点入栈
{
top++;
St[top]=p->rchild;
}
if (p->lchild!=NULL) //左孩子节点入栈
{
top++;
St[top]=p->lchild;
}
}
}
//非递归中序
void InOrder1(BTNode *b)
{
BTNode *St[MaxSize],*p;
int top=-1;
p=b;
while (top>-1 || p!=NULL)
{
while (p!=NULL)
{
top++;
St[top]=p;
p=p->lchild;
}
if (top>-1)
{
p=St[top];
top--;
printf("%c ",p->data);
p=p->rchild;
}
}
}
//非递归后序
void PostOrder1(BTNode *b)
{
BTNode *St[MaxSize];
BTNode *p;
int flag,top=-1;
if(b!=NULL)
do
{
//将*b的所有左节点进栈
while (b!=NULL)
{
top++;
St[top]=b;
b=b->lchild;
}
p=NULL;
flag=1; //表示*b的左子树已访问或为空
while (top!=-1 && flag==1)
{
b=St[top];
//处理*b节点
if (b->rchild==p)
{
printf("%c ",b->data);
top--;
p=b;
}
else
{
b=b->rchild;
flag=0;
}
}
}
while (top!=-1);
}
//层序遍历
void LevelOrder(BTNode *b)
{
BTNode *p;
BTNode *qu[MaxSize];
int front,rear;
front=rear=-1;
rear++; //根节点入队
qu[rear]=b;
while (front!=rear)
{
//从队列中出列一个节点*p,访问它;
//若它有左孩子节点,将左孩子节点进队;
//若它有右孩子节点,将右孩子节点进队。
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;
}
}
}
main.c
#include "BinaryTree.h"
int main()
{
BTNode *b;
char *str = "A(B(D(,G)),C(E,F))";
CreateBTNode(&b,str);
DispBTNode(b);
printf("二叉树深度:%d\n",BTNodeDepth(b));
printf("\n前序遍历:");
PreOrder(b);
printf("\n中序遍历:");
InOrder(b);
printf("\n后序遍历:");
PostOrder(b);
printf("\n非递归前序遍历:");
PreOrder1(b);
printf("\n非递归中序遍历:");
InOrder1(b);
printf("\n非递归后序遍历:");
PostOrder1(b);
printf("\n层序遍历:");
LevelOrder(b);
return 0;
}