head.h

二叉树的实现代码 前序遍历 中序遍历 后序遍历

#include<string.h>
#include<ctype.h>
#include<malloc.h>
#include<limits.h>  //INT_MAX等
#include<stdio.h>
#include<stdlib.h>  //atoi()
#include<math.h>
#include<process.h> //exit
#include<iostream.h>

#define TRUE  1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE -1
typedef int Status;



#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10


typedef struct BiTNode
{
    char Data;
    struct BiTNode* lChild;
    struct BiTNode* rChild;
}BiTNode,*BiTree;

struct SqStack{
	BiTree *base;
	BiTree *top;
	int stacksize;
};

Status InitBiTree(BiTree &pTree);

Status DestroyBiTree(BiTree &pTree);
Status CreateTree(BiTree &pTree);
Status ClearBiTree(BiTree &pTree);
Status Visit(char Data);
void PreOrderTraval(BiTree &pTree);
void PostOrderTraval(BiTree &pTree);
void InOrderTraval(BiTree &pTree);//递归中序遍历
int BiLeafCount(BiTree pTree);
int BiTreeDepth(BiTree pTree);
Status InOrderTraverse(BiTree pTree,Status (*Visit)(char Data));//非递归中序遍历
void AllPath( BiTree pTree,SqStack &S);

Status InitStack(SqStack &S);
Status DestroyStack(SqStack &S);
Status ClearStack(SqStack &S);
Status StackEmpty(SqStack &S);
Status Push(SqStack &S,BiTNode* e);
Status Pop(SqStack &S,BiTNode* &e);
Status vist (BiTree* e );
Status StackTraverse(SqStack S,Status (* vist)(BiTree* e));