#include <iostream>
#include<queue>
using namespace std;
//定义二叉树结构
typedef struct Node
{
char data;
struct Node* lchild, * rchild;
}*BiTree,BiTNode;//定义BiTNode为Node型是为了后面开辟新节点空间,用来添加节点等功能
//先序创建二叉树
void CreateBiTree(BiTree& T) //测试例子AB#CD##E##F#GH###
{
char ch;
cin >> ch;
if (ch == '#')
{
T = NULL;
}
else {
T = new BiTNode;
T->data = ch;
CreateBiTree(T->lchild);//迭代方式创建树
CreateBiTree(T->rchild);
}
}
//先序遍历(根左右)
void PreOrderTraverse(BiTree T)
{
if (T)
{
cout << T->data;
PreOrderTraverse(T->lchild);
PreOrderTraverse(T->rchild);
}
}
//中序遍历(左根右)
void InOrderTraverse(BiTree T)
{
if (T)
{
InOrderTraverse(T->lchild);
cout << T->data;
InOrderTraverse(T->rchild);
}
}
//后序遍历(左右根)
void PostOrderTraverse(BiTree T)
{
if (T)
{
PostOrderTraverse(T->lchild);
PostOrderTraverse(T->rchild);
cout << T->data;
}
}
//层序遍历(从上到下从左到右)
void LevelOrderTraverse(BiTree T) {
queue<BiTree> Q; //构建一个对列存放BiTree型的数
if (T) {
Q.push(T);
while (!Q.empty()) {
BiTree tmp = Q.front();
Q.pop();
cout<<tmp->data;
if (tmp->lchild)
Q.push(tmp->lchild);
if (tmp->rchild)
Q.push(tmp->rchild); //节奏是先弹出根,再是左右子树入列再弹出
}
}
}
//树的深度
int Depth(BiTree T)
{
if (T == NULL)
return 0;
else
{
int m = Depth(T->lchild);
int n = Depth(T->rchild);
if (m > n)
{
return (m + 1);
}
else
{
return (n + 1);
}
}
}
//统计二叉树中结点的个数
int NodeCount(BiTree T)
{
if (T == NULL)
{
return 0;
}
else
{
return NodeCount(T->lchild) + NodeCount(T->rchild) + 1;
}
}
//统计二叉树中叶子结点的个数
int LeafCount(BiTree T)
{
if (T == NULL)
{
return 0;
}
if (T->lchild == NULL && T->rchild == NULL)
{//如果二叉树左子树和右子树皆为空,说明该二叉树根节点为叶子节点,加1.
return 1;
}
else
{
return LeafCount(T->lchild) + LeafCount(T->rchild);
}
}
//统计二叉树的度为1的结点个数
int Node_1_Count(BiTree T)
{
if (T == NULL)
{
return 0;
}
if ((T->lchild == NULL && T->rchild) || (T->lchild && T->rchild == NULL))
{
return 1 + Node_1_Count(T->lchild) + Node_1_Count(T->rchild);
}
else
{
return Node_1_Count(T->lchild) + Node_1_Count(T->rchild);
}
}
//二叉树中从每个叶子结点到根结点的路径
void PrintAllPath(BiTree T, char path[], int pathlen)
{
int i;
if (T != NULL) {
path[pathlen] = T->data; //将当前结点放入路径中
if (T->lchild == NULL && T->rchild == NULL) {//叶子结点
for (i = pathlen; i >= 0; i--)
cout << path[i] << " ";
cout << endl;
}
else {
PrintAllPath(T->lchild, path, pathlen + 1);
PrintAllPath(T->rchild, path, pathlen + 1);
}
}
}
//二叉树的双序遍历----根左根右
void DblOrderTraverse(BiTree T)
{
if (T)
{
cout << T->data;
DblOrderTraverse(T->lchild);
cout << T->data;//访问第二遍
DblOrderTraverse(T->rchild);
}
}
#include"标头.h"
int main()
{
BiTree T;
//测试例子ab#cd##e##f#gh###
cout << "输入(以#结束):";
CreateBiTree(T);
cout << endl << "先序遍历输出:";
PreOrderTraverse(T);
cout << endl << "中序遍历输出:";
InOrderTraverse(T);
cout << endl << "后序遍历输出:";
PostOrderTraverse(T);
cout << endl << "层序遍历输出:";
LevelOrderTraverse(T);
cout << endl << "该树的深度为:";
cout << Depth(T);
cout << endl << "该树的节点个数为:";
cout << NodeCount(T);
cout << endl << "该树的叶节点个数为:";
cout << LeafCount(T);
cout << endl << "该树的度为1的节点个数为:";
cout << Node_1_Count(T);
cout << endl << "二叉树中从每个叶子结点到根结点的所有路径:" << endl;
char path[256];
int pathlen = 0;
PrintAllPath(T, path, pathlen);
cout << endl << "双序遍历输出:";
DblOrderTraverse(T);
}
关于树的一些操作
最新推荐文章于 2024-10-09 17:48:02 发布