其实实验课时已做好,一直忘记发
《数据结构》实验五: 树和二叉树实验
一..实验目的
巩固树和二叉树的相关知识,特别是二叉树的相关内容。学会运用灵活应用。
1.回树和二叉树的逻辑结构和存储方法,清楚掌握树和二叉树的遍历操作。
2.学习树的相关知识来解决实际问题。
3.进一步巩固程序调试方法。
4.进一步巩固模板程序设计。
二..实验内容
1.自己设计一个二叉树,深度最少为4,请递归算法分别用前序、中序、后序遍历输出树结点。
#ifndef bitree_h_H
#define bitree_h_H
struct binode
{
char data;
binode *lchild,*rchild;
};
class bitree
{
public:
bitree(){root=creat(root);}
~bitree(){release(root);}
void preorder(){preorder(root);}
void inorder(){inorder(root);}
void postorder(){postorder(root);}
private:
binode *root;
binode *creat(binode *bt);
void release(binode *bt);
void preorder(binode *bt);
void inorder(binode *bt);
void postorder(binode *bt);
};
#endif
#define bitree_h_H
struct binode
{
char data;
binode *lchild,*rchild;
};
class bitree
{
public:
bitree(){root=creat(root);}
~bitree(){release(root);}
void preorder(){preorder(root);}
void inorder(){inorder(root);}
void postorder(){postorder(root);}
private:
binode *root;
binode *creat(binode *bt);
void release(binode *bt);
void preorder(binode *bt);
void inorder(binode *bt);
void postorder(binode *bt);
};
#endif
#include<iostream>
using namespace std;
#include"bitree.h"
binode *bitree::creat(binode *bt)
{
char ch;
cout<<"please input"<<endl;
cin>>ch;
if(ch=='#')return NULL;
else
{
bt=new binode;
bt->data=ch;
bt->lchild=creat(bt->lchild);
bt->rchild=creat(bt->rchild);
}
return bt;
}
void bitree::release(binode *bt)
{
if(bt!=NULL)
{
release(bt->lchild);
release(bt->rchild);
delete bt;
}
}
void bitree::preorder(binode *bt)
{
if(bt==NULL)return;
else
{
cout<<bt->data <<" ";
preorder(bt->lchild);
preorder(bt->rchild);
}
}
void bitree::inorder(binode *bt)
{
if(bt==NULL)return;
else
{
inorder(bt->lchild);
cout<<bt->data <<" ";
inorder(bt->rchild);
}
}
void bitree::postorder(binode *bt)
{
if(bt==NULL)return;
else
{
postorder(bt->lchild);
postorder(bt->rchild);
cout<<bt->data <<" ";
}
}
void main()
{
bitree A;
cout<<"-------preorder--------"<<endl;
A.preorder();
cout<<endl;
cout<<"-------inorder---------"<<endl;
A.inorder();
cout<<endl;
cout<<"------postorder--------"<<endl;
A.postorder();
cout<<endl;
}
using namespace std;
#include"bitree.h"
binode *bitree::creat(binode *bt)
{
char ch;
cout<<"please input"<<endl;
cin>>ch;
if(ch=='#')return NULL;
else
{
bt=new binode;
bt->data=ch;
bt->lchild=creat(bt->lchild);
bt->rchild=creat(bt->rchild);
}
return bt;
}
void bitree::release(binode *bt)
{
if(bt!=NULL)
{
release(bt->lchild);
release(bt->rchild);
delete bt;
}
}
void bitree::preorder(binode *bt)
{
if(bt==NULL)return;
else
{
cout<<bt->data <<" ";
preorder(bt->lchild);
preorder(bt->rchild);
}
}
void bitree::inorder(binode *bt)
{
if(bt==NULL)return;
else
{
inorder(bt->lchild);
cout<<bt->data <<" ";
inorder(bt->rchild);
}
}
void bitree::postorder(binode *bt)
{
if(bt==NULL)return;
else
{
postorder(bt->lchild);
postorder(bt->rchild);
cout<<bt->data <<" ";
}
}
void main()
{
bitree A;
cout<<"-------preorder--------"<<endl;
A.preorder();
cout<<endl;
cout<<"-------inorder---------"<<endl;
A.inorder();
cout<<endl;
cout<<"------postorder--------"<<endl;
A.postorder();
cout<<endl;
}