#include<iostream>
#include<cmath>
using namespace std;
#define MAXSIZE 100
typedef char BiTree[MAXSIZE];
void InitBiTree(BiTree& t);//赋初始值前的准备
void CreateBiTree(BiTree& a);//二叉树赋初始值
int BiTreeEmpty(BiTree t);//判断二叉树是否为空
void BiTreeDepth(BiTree t);//计算二叉树的深度
void GetRoot(BiTree t);//取二叉树的根值
void Traverse(BiTree t, int n);//层序次序遍历打印二叉树
void PreTraverse(BiTree t, int i);//先序遍历打印二叉树
void InTraverse(BiTree t, int i);//中序遍历打印二叉树
void PostTraverse(BiTree t, int i);//后序遍历打印二叉树
void InitBiTree(BiTree&t)
{
char* p = t;
for (int i = 0; i < MAXSIZE; i++)
{
*p = ' ';
p++;
}
}
void CreateBiTree(BiTree&a)
{
char ch =0;
char* t = a;
cout << "请按层序次序输入二叉树各结点的值,空结点用0表示:" << endl;
ch = cin.get();
while (ch != '\n')
{
*t = ch;
ch = cin.get();
t++;
}
}
int BiTreeEmpty(BiTree t)
{
if (t[0] == 0)
{
return 1;
}
else
{
return 0;
}
}
void BiTreeDepth(BiTree t)
{
if (BiTreeEmpty(t)) return;
int j = 1; int i = 0;
for (i = MAXSIZE - 1; i >= 0; i--)
{
if (t[i] != ' ')
{
break;
}
}
i++;
while (i >pow(2, j)-1)
{
j++;
}
cout << "二叉树的深度:" << j << endl;
}
void GetRoot(BiTree t)
{
if (BiTreeEmpty(t))return;
cout << "根节点的值:"<<t[0] << endl;
}
void TreeVist(char e)
{
cout << e;
}
void PreTraverse(BiTree t,int i)
{
TreeVist(t[i]);
if (t[2 * i + 1] != '0'&& t[2 * i + 1] != ' ')
{
PreTraverse(t, 2 * i + 1);
}
if (t[2 * i + 2] != '0' && t[2 * i + 2] != ' ')
{
PreTraverse(t, 2 * i + 2);
}
}
void InTraverse(BiTree t, int i)
{
if (t[2 * i + 1] != '0' && t[2 * i + 1] != ' ')
{
InTraverse(t, 2 * i + 1);
}
TreeVist(t[i]);
if (t[2 * i + 2] != '0' && t[2 * i + 2] != ' ')
{
InTraverse(t, 2 * i + 2);
}
}
void PostTraverse(BiTree t, int i)
{
if (t[2 * i + 1] != '0' && t[2 * i + 1] != ' ')
{
PostTraverse(t, 2 * i + 1);
}
if (t[2 * i + 2] != '0' && t[2 * i + 2] != ' ')
{
PostTraverse(t, 2 * i + 2);
}
TreeVist(t[i]);
}
void Traverse(BiTree t, int n)
{
int i = n;
while (t[i] != ' ')
{
if (t[i] == '0')
{
i++;
continue;
}
cout << t[i];
i++;
}
}
int main()
{
BiTree T;
InitBiTree(T);
CreateBiTree(T);
if (BiTreeEmpty(T))cout << "二叉树为空" << endl;
else cout << "二叉树不为空" << endl;
BiTreeDepth(T);
GetRoot(T);
cout << "层次序列遍历二叉树:" << endl;
Traverse(T, 0);
cout <<endl<< "先序遍历二叉树:" << endl;
PreTraverse(T,0);
cout << endl<<"中序遍历二叉树:" << endl;
InTraverse(T,0);
cout << endl<<"后序遍历二叉树:" << endl;
PostTraverse(T,0);
return 0;
}