新鲜出炉的数据结构二叉树二叉链表的遍历,递归算法,三种遍历含创建二叉树函数哦!请看下面干货!
头文件1:基本定义头文件
#include"stdio.h"
#include"stdlib.h"
#define OK 1
#define FALSE -1
#define TURE 1
#define ERROR -1
#define OVERFLOW -2
typedef int TElemType;
typedef int Status;
typedef struct BiTNode {
TElemType data;
struct BiTNode *lchild, *rchild;
}BiTNode, *BiTree;
Status Visit(char data)
{
printf("%c", data);
return OK;
}
头文件2:三种遍历函数
#include"header.h"
Status CreateBiTNode(BiTree &T)
{
char ch;
scanf_s("%c", &ch);
printf("\n");
if (ch == '#')
{
T = NULL;
}
else
{
if (!(T = (BiTNode*)malloc(sizeof(BiTNode))))
{
exit(OVERFLOW);
}
T->data = ch;
CreateBiTNode(T->lchild);
CreateBiTNode(T->rchild);
}
return OK;
}
Status PreOrderTraverse(BiTree T)//先序遍历二叉树
{
if (T)
{
if (Visit(T->data))
{
if (PreOrderTraverse(T->lchild))
{
if (PreOrderTraverse(T->rchild))
{
return OK;
}
}
}
return ERROR;
}
else
{
return OK;
}
}
Status InOrderTraverse(BiTree T)//中序遍历二叉树
{
if (T)
{
if (InOrderTraverse(T->lchild))
{
if (Visit(T->data))
{
if (InOrderTraverse(T->rchild))
{
return OK;
}
}
return ERROR;
}
return ERROR;
}
else
{
return OK;
}
}
Status PostOrderTraverse(BiTree T)//后序遍历二叉树
{
if (T)
{
if (PostOrderTraverse(T->lchild))
{
if (PostOrderTraverse(T->rchild))
{
if (Visit(T->data))
{
return OK;
}
return ERROR;
}
}
return ERROR;
}
else
{
return OK;
}
}
主函数:对遍历的调用测试
#include "stdafx.h"
#include"header1.h"
int main()
{
BiTree T;
printf("请按先序输入你想创建的二叉树: ");
CreateBiTNode(T);
printf("先序遍历为:");
PreOrderTraverse(T);
printf(" ");
printf("\n");
printf("中序遍历为:");
InOrderTraverse(T);
printf(" ");
printf("\n");
printf("后序遍历为:");
PostOrderTraverse(T);
printf(" ");
printf("\n");
return 0;
}