前言
今天用代码实现了一下树的构建,以及层序遍历、前序遍历、中序遍历、后序遍历四种方式,来记录一下,以免将来忘记。
一、树的数据结构
树:
1、根(爹)
2、左子树(左孩子)
3、右子树(右孩子)
代码实现:
struct Tree
{
int data;
Tree* lchild, * rchild;
};
二、树的插入数据
//二叉树插入数据
void Insert(Tree *&tree,int num) {
tree = (Tree*)malloc(sizeof(Tree));
tree->data = num;
tree->lchild = NULL;
tree->rchild = NULL;
}
三、四种遍历方式
层序遍历:
//层序遍历
void printTreeNodeC(Tree* tree) {
queue<Tree*> t;
t.push(tree);
while (!t.empty()) {
cout << t.front()->data << " ";
Tree* h = t.front();
t.pop();
if (h->lchild != NULL) {
t.push(h->lchild);
}
if (h->rchild != NULL) {
t.push(h->rchild);
}
}
}
前序遍历:
//前序遍历
void printTreeNodeQ(Tree* tree) {
if (tree != NULL) {
cout << tree->data << " ";
printTreeNodeQ(tree->lchild);
printTreeNodeQ(tree->rchild);
}
}
中序遍历:
//中序遍历
void printTreeNodeZ(Tree* tree) {
if (tree != NULL) {
printTreeNodeZ(tree->lchild);
cout << tree->data << " ";
printTreeNodeZ(tree->rchild);
}
}
后序遍历:
//后序遍历
void printTreeNodeH(Tree* tree) {
if (tree != NULL) {
printTreeNodeH(tree->lchild);
printTreeNodeH(tree->rchild);
cout << tree->data << " ";
}
}
四、完整测试代码展示
// 中序线索二叉树.cpp : 此文件包含 "main" 函数。程序执行将在此处开始并结束。
//
#include <iostream>
#include<iostream>
#include<queue>
using namespace std;
struct Tree
{
int data;
Tree* lchild, * rchild;
};
//二叉树插入数据
void Insert(Tree *&tree,int num) {
tree = (Tree*)malloc(sizeof(Tree));
tree->data = num;
tree->lchild = NULL;
tree->rchild = NULL;
}
//层序遍历
void printTreeNodeC(Tree* tree) {
queue<Tree*> t;
t.push(tree);
while (!t.empty()) {
cout << t.front()->data << " ";
Tree* h = t.front();
t.pop();
if (h->lchild != NULL) {
t.push(h->lchild);
}
if (h->rchild != NULL) {
t.push(h->rchild);
}
}
}
//前序遍历
void printTreeNodeQ(Tree* tree) {
if (tree != NULL) {
cout << tree->data << " ";
printTreeNodeQ(tree->lchild);
printTreeNodeQ(tree->rchild);
}
}
//中序遍历
void printTreeNodeZ(Tree* tree) {
if (tree != NULL) {
printTreeNodeZ(tree->lchild);
cout << tree->data << " ";
printTreeNodeZ(tree->rchild);
}
}
//后序遍历
void printTreeNodeH(Tree* tree) {
if (tree != NULL) {
printTreeNodeH(tree->lchild);
printTreeNodeH(tree->rchild);
cout << tree->data << " ";
}
}
int main()
{
Tree* tree = NULL;
Insert(tree, 1);
Insert(tree->lchild, 2);
Insert(tree->rchild, 3);
Insert(tree->lchild->lchild, 4);
Insert(tree->lchild->rchild, 5);
Insert(tree->rchild->lchild, 6);
Insert(tree->rchild->rchild, 7);
cout << "层序遍历结果:";
printTreeNodeC(tree);
cout << endl;
cout << "前序遍历结果:";
printTreeNodeQ(tree);
cout << endl;
cout << "中序遍历结果:";
printTreeNodeZ(tree);
cout << endl;
cout << "后序遍历结果:";
printTreeNodeH(tree);
}
总结
简单的二叉树的创建与插入数据,四种遍历方式,其中前中后都为递归方式,非递归方式较递归而言不容易理解,不在这次记录,最终的测试代码可以运行,唯一的不足就是在建立树的方式笨重,有喜欢的小伙伴可以再创造。