#include<stdio.h>
#include<stdlib.h>
#define MaxSize 50
typedef char ElemType;
typedef struct BTNode
{
ElemType data;
struct BTNode *left;
struct BTNode *right;
}BTNode,*BiTree;
typedef struct Stack
{
BTNode *data[MaxSize];
int top;
}SqStack;
void InitStack(SqStack &S) //初始化栈
{
S.top = -1;
}
bool IsStackEmpty(SqStack S) //判断栈是否为空
{
if(S.top == -1)
return true;
else
return false;
}
void Push(SqStack &S,BTNode *B) //进栈
{
S.data[++S.top] = B;
}
void Pop(SqStack &S,BTNode *&B) //出栈
{
B = S.data[S.top--];
}
void createBiTree(BTNode *&BT) //创建二叉树
{
ElemType ch;
scanf("%c",&ch);
if(ch==' ')
BT=NULL;
else
{
BT = (BTNode*)malloc(sizeof(BTNode));
BT->data = ch;
createBiTree(BT->left);
createBiTree(BT->right);
}
}
void DLR(BiTree B) //先序遍历二叉树
{
if(B)
{
printf("%c ",B->data);
DLR(B->left);
DLR(B->right);
}
}
void PreOrder(BiTree B) //非递归先序遍历二叉树
{
SqStack S;
InitStack(S);
while(B || (!IsStackEmpty(S)))
{
if(B)
{
printf("%c ",B->data);
Push(S,B);
B = B->left;
}
else
{
Pop(S,B);
B = B->right;
}
}
printf("\n");
}
void main()
{
BiTree B;
createBiTree(B);
printf("先序遍历:");
DLR(B);
printf("\n");
printf("先序非递归遍历:");
PreOrder(B);
}
按先序遍历依次输入二叉树结点,若孩子结点为空,则输入空格。
输入:
ABD E CF
输出:
先序遍历:A B D E C F
先序非递归遍历:A B D E C F