非递归遍历二叉树算法2

{
if(S.base == S.top)
return TRUE;
else
return FALSE;
}
Status CreateTree(BitTree *T)
{
char ch;
scanf("%c",&ch);
if(ch == ' ')
{
*T = NULL;
}
else
{
*T = (TreeNode *)malloc(LIST_SIZE*sizeof(TreeNode));
if(!(*T))
{
printf("分配内存空间失败!\n");
exit(OVERFLOW);
}
(*T)->data = ch;
e.ptr = p->lchild;
e.task = Travel;
PushStack(&S,e);
e.ptr = p;
e.task = Visit;
PushStack(&S,e);
}
}
}
}
//中序遍历二叉树
e.ptr = p->rchild;
e.task = Travel;
PushStack(&S,e);
e.ptr = p;
e.task = Visit;
PushStack(&S,e);
e.ptr = p->lchild;
e.task = Travel;
PushStack(&S,e);
}
}
}
}
//后序遍历二叉树
void LastVisit(BitTree T,void (*VisitTree)(TreeNode * q))
{
BiNode S;
InitStack(&S);
StackNode e;
{
if(S->base == S->top)
{
printf("栈为空！\n");
return ERROR;
}
*e = *S->top;
return OK;
}
Status EmptyStack(BiNode S) //检查栈是否为空,空则返回TRUE否则返回FALSE
CreateTree(&((*T)->lchild));
CreateTree(&((*T)->rchild));
}
return OK;
}
//前序遍历二叉树
void PreVisit(BitTree T,void (*VisitTree)(TreeNode * q))
{
BiNode S;
if(T)
PushStack(&S,e);
while(!EmptyStack(S))
{
PopStack(&S,&e);
if(e.task == Visit)
VisitTree(e.ptr);
else
{
if(e.ptr)
{
p = e.ptr;
exit(OVERFLOW);
}
S->base = newbase->base;
S->stacksize += LIST_INCRE;
}
*S->top++ = e;
return OK;
}
Status PopStack(BiNode *S,StackNode *e) //从栈顶删除元素
}
void GetNodeNum(BitTree T,int h,int *depth) //利用先序遍历获得树的深度
{
if(T)
{
if(h > *depth)
*depth = h;
GetNodeNum(T->lchild,h+1,depth);
GetNodeNum(T->rchild,h+1,depth);
else
{
if(e.ptr)
{
p = e.ptr;
e.task = Visit;
PushStack(&S,e);
e.ptr = p->rchild;
e.task = Travel;
PushStack(&S,e);
#define LIST_SIZE 20
#define LIST_INCRE 10
typedef enum{Travel = 1,Visit = 0}TaskType;
typedef struct TreeNode //二叉树的存储结构
{
struct TreeNode *lchild,*rchild;
BitTree p;
e.ptr = T;
e.task = Travel;
if(T)
PushStack(&S,e);
while(!EmptyStack(S))
{
PopStack(&S,&e);
if(e.task == Visit)
VisitTree(e.ptr);
{
printf("分配内存空间失败！\n");
exit(OVERFLOW);
}
S->stacksize = LIST_SIZE;
return OK;
}
Status PushStack(BiNode *S,StackNode e) //往栈顶压入元素
{
BiNode *newbase;
int stacksize;
}BiNode;
Status InitStack(BiNode *S) //构造一个空栈
{
S->top = S->base = (StackNode *)malloc(LIST_SIZE*sizeof(StackNode));
if(!S->base)
#include<stdio.h>
#include<stdlib.h>
#define OK 1
#define FALSE 0
#define TRUE 1
#define ERROR 0
#define OVERFLOW -1
#define Status int
#define ElemType int
if(e.task == Visit)
VisitTree(e.ptr);
else
{
if(e.ptr)
{
p = e.ptr;
e.ptr = p->rchild;
e.task = Travel;
PushStack(&S,e);
e.ptr = p->lchild;
e.task = Travel;
PushStack(&S,e);
}
}
}
}
void VisitTree(TreeNode *q) //访问二叉树中的节点
{
printf("%3c",q->data);
printf("\n");
printf("\n");
depth1 = GetNodeNum1(T);
printf("算法 2 求得的树的深度为:%d",depth1);
printf("\n");
return 0;
}
if(hl > hr)
return hl+1;
else
return hr+1;
}
}
int main()
{
BitTree T;
int depth = 0;
int h = 1;
int depth1 = 0;
printf("请按照先序输入字符创建一棵树:");
InitStack(&S);
StackNode e;
BitTree p;
e.ptr = T;
e.task = Travel;
if(T)
PushStack(&S,e);
while(!EmptyStack(S))
{
PopStack(&S,&e);
}
}
int GetNodeNum1(BitTree T) //利用 后序遍历获得树的深度
{
int hl,hr;
if(!T)
return 0;
else
{
hl = GetNodeNum1(T->lchild);
hr = GetNodeNum1(T->rchild);
if((S->top - S->base) >= S->stacksize)
{
newbase->base = (StackNode *)realloc(S->base,LIST_INCRE*sizeof(StackNode));
if(!newbase->base)
{
printf("分配内存空间失败！\n");