c++创建二叉树及二叉树的遍历

tree.h文件
#pragma once
typedef struct Bnode
{
char data;
struct Bnode *lchild, *rchild;
}Bnode, *btree;
class tree
{
public:
void creattree(btree &T);
void preorder(btree T);
void inorder(btree T);
void posorder(btree T);
bool leveltraverse(btree T);
private:
};
tree.cpp文件
#include
#include “tree.h”
#include “queue”
using namespace std;
void tree::creattree(btree &T){
char ch;
cin >> ch;
if (ch == ‘#’)
T = NULL;
else
{
T = new Bnode;
T->data = ch;//生成根节点
creattree(T->lchild);//递归创建左子树
creattree(T->rchild);//递归创建右子树
}
}
//先序遍历
void tree::preorder(btree T){
if (T){
cout << T->data << " ";
preorder(T->lchild);
preorder(T->rchild);
}
}
//中序遍历
void tree::inorder(btree T){
if (T){
inorder(T->lchild);
cout << T->data << " ";
inorder(T->rchild);
}
}
//后序遍历
void tree::posorder(btree T){
if (T){
posorder(T->lchild);
posorder(T->rchild);
cout << T->data << " ";
}
}
bool tree::leveltraverse(btree T){
btree p;
if (!T) return false;
queueQ;//创建一个队列，里面存放指针类型
Q.push(T);//根指针入栈
while (!Q.empty())
{
p = Q.front();//取队头元素作为扩展节点
Q.pop();
cout << p->data << endl;
if (p->lchild) Q.push(p->lchild);//左孩子指针入队
if (p->rchild) Q.push(p->rchild);//右孩子指针入栈
}
return true;
}
main.cpp文件
#include
#include “tree.h”
#include
using namespace std;
int main(){
btree mytree;
tree mytree1;
cout << “按先序遍历输入二叉树中节点的值，孩子为空时输入#，创建一个二叉树” << endl;
mytree1.creattree(mytree);
cout << endl;
cout << “先序遍历结果” << endl;
mytree1.preorder(mytree);
cout << endl;
cout << “中序遍历结果” << endl;
mytree1.inorder(mytree);
cout << endl;
cout << “后序遍历结果” << endl;
mytree1.posorder(mytree);
cout << endl;
cout << “层次遍历二叉树” << endl;
mytree1.leveltraverse(mytree);
cout << endl;
cin.get();
return 0;
}