创建一棵树
struct Node
{
int data;
Node *left;
Node *right;
Node(int data)
{
this->data=data;
this->left=NULL;
this->right=NULL;
}
};
class BinTree
{
public:
Node *root;
Node* CreateTree();
void preOrder(Node *r);
void InOrder(Node *r);
void PostOrder(Node *r);
};
Node* BinTree::CreateTree(){
Node *p1=new Node(1);
Node *p2=new Node(2);
Node *p3=new Node(3);
Node *p4=new Node(4);
Node *p5=new Node(5);
Node *p6=new Node(6);
Node *p7=new Node(7);
Node *p8=new Node(8);
Node *p9=new Node(9);
p1->left=p2;
p1->right=p3;
p2->left=p4;
p2->right=p5;
p5->left=p6;
p3->left=p7;
p3->right=p8;
p8->right=p9;
root=p1;
return p1;
}
先序遍历二叉树
void BinTree::preOrder(Node *r){
if(r==NULL){
return ;
}
else{
cout<<r->data<<" ";
preOrder(r->left);
preOrder(r->right);
}
}
在这里插入代码片
中序遍历二叉树
规则: 1.为空则什么都不做
2. 中序遍历左子树
3. 访问根节点
4. 遍历右子树
中序遍历结果: 4 、2、6、5、1、7、3、8、9
**/
void BinTree::InOrder(Node *r){
if(r==NULL){
return ;
}
else {
InOrder(r->left);
cout<<r->data<<" ";
InOrder(r->right);
}
}
在这里插入代码片
后序遍历二叉树
void BinTree::PostOrder(Node *r){
if(r==NULL){
return ;
}
else{
PostOrder(r->left);
PostOrder(r->right);
cout<<r->data<<" ";
}
}
整体代码
#include<iostream>
using namespace std;
struct Node
{
int data;
Node *left;
Node *right;
Node(int data)
{
this->data=data;
this->left=NULL;
this->right=NULL;
}
};
class BinTree
{
public:
Node *root;
Node* CreateTree();
void preOrder(Node *r);
void InOrder(Node *r);
void PostOrder(Node *r);
};
Node* BinTree::CreateTree(){
Node *p1=new Node(1);
Node *p2=new Node(2);
Node *p3=new Node(3);
Node *p4=new Node(4);
Node *p5=new Node(5);
Node *p6=new Node(6);
Node *p7=new Node(7);
Node *p8=new Node(8);
Node *p9=new Node(9);
p1->left=p2;
p1->right=p3;
p2->left=p4;
p2->right=p5;
p5->left=p6;
p3->left=p7;
p3->right=p8;
p8->right=p9;
root=p1;
return p1;
}
void BinTree::preOrder(Node *r){
if(r==NULL){
return ;
}
else{
cout<<r->data<<" ";
preOrder(r->left);
preOrder(r->right);
}
}
void BinTree::InOrder(Node *r){
if(r==NULL){
return ;
}
else {
InOrder(r->left);
cout<<r->data<<" ";
InOrder(r->right);
}
}
void BinTree::PostOrder(Node *r){
if(r==NULL){
return ;
}
else{
PostOrder(r->left);
PostOrder(r->right);
cout<<r->data<<" ";
}
}
int main(){
BinTree t;
t.CreateTree();
cout<<"先序遍历: ";
t.preOrder(t.root);
cout<<endl;
cout<<"中序遍历:";
t.InOrder(t.root);
cout<<endl;
cout<<"后序遍历: ";
t.PostOrder(t.root) ;
cout<<endl;
}
- 运行效果