趣学算法–二叉树(C语言)
用C语言写的关于二叉树的创建和操作方式,加入了一些c++的;代码如下.h文件:
#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
#include<stdbool.h>
#include<stdbool.h>
#include<queue>
using namespace std;
typedef int ElemType;
typedef struct Bnode
{
ElemType data;
struct Bnode* lchild, * rchild, *parent;
}Bnode ,*Btree;
Btree createtree(Btree T);//询问法创建树
void Createtree(Btree T); //补空法,但是需要遍历首先,补空;
void preorder(Btree T);//先序遍历,DLR
void inorder(Btree T);//LDR
void posorder(Btree T);
bool LevelTraverse(Btree T);//层次遍历
int Depth(Btree T); //计算深度
int LeafCount(Btree T); //计算叶子数
int NodeCount(Btree T);//计算节点
.c文件如下:
#define _CRT_SECURE_NO_WARNINGS 1
#include "tree.h"
Btree createtree(Btree T)
{
char check ;
T = (Bnode*)malloc(sizeof(Bnode));
printf("输入根节点的数据:\n");
scanf("%d", &(T->data));
getchar();
printf("是否创建 %d 的左节点?(Y/N):\n",T->data);
scanf("%c", &check);
if (check == 'Y')
{
T->lchild=createtree(T->lchild);
}
else
{
T->lchild = NULL;
}
getchar();
printf("是否创建 %d 的右节点?(Y/N):\n", T->data);
scanf("%c", &check);
if (check == 'Y')
{
T->rchild= createtree(T->rchild);
}
else
{
T->rchild = NULL;
}
return T;
}
void Createtree(Btree T)
{
char ch;
scanf("%c", &ch);
if (ch == '#')
T = NULL;
else
{
T = (Bnode*)malloc(sizeof(Bnode));
T->data = ch;
Createtree(T->lchild);
Createtree(T->rchild);
}
}
void preorder(Btree T)
{
if (T)
{
printf("先序遍历:%d\n", T->data);
preorder(T->lchild);
preorder(T->rchild);
}
}
void inorder(Btree T)
{
if (T)
{
inorder(T->lchild);
printf("中序遍历:%d\n", T->data);
inorder(T->rchild);
}
}
void posorder(Btree T)
{
if (T)
{
posorder(T->lchild);
posorder(T->rchild);
printf("后序遍历:%d\n", T->data);
}
}
bool LevelTraverse(Btree T)
{
Btree p;
if (!T)
return false;
queue<Btree>Q;//创建一个队列
Q.push(T);//根指针入队
while (!Q.empty())
{
p = Q.front();
Q.pop();
printf("取出的元素:%d\n", p->data);
if (p->lchild)
Q.push(p->lchild);
if (p->rchild)
Q.push(p->rchild);
}
return true;
}
int Depth(Btree T)
{
int m, n;
if (NULL == T)
return 0;
else
{
m = Depth(T->lchild);
n = Depth(T->rchild);
if (m > n)
return m + 1;
else
return n + 1;
}
}
int LeafCount(Btree T)
{
if (NULL == T)
return 0;
else
{
if (NULL == T->lchild && NULL == T->rchild)
return 1;
else
return LeafCount(T->lchild) + LeafCount(T->rchild);
}
}
int NodeCount(Btree T)
{
if (NULL == T)
return 0;
else
return NodeCount(T->lchild) + NodeCount(T->rchild) + 1;
}
mian函数
#define _CRT_SECURE_NO_WARNINGS 1
#include"tree.h"
int main()
{
int i = 0;
Btree head_1 = NULL;
Bnode Tr;
head_1 = createtree(&Tr);//创建
preorder(head_1);//遍历
printf("\n");
inorder(head_1);//遍历
printf("\n");
posorder(head_1);
printf("\n");
LevelTraverse(head_1);
printf("深度为:%d\n", Depth(head_1));
printf("叶子数为:%d\n", LeafCount(head_1));
printf("节点数为:%d\n", NodeCount(head_1));
return 0;
}
说明
本来是用c写的,后来用到一个函数,改成了c++,但是里面的文件基本上都是c语言写的,基本上可以兼容。