#include<iostream>
#include <queue>
using namespace std;
struct Binary_node
{
char data; //data members
Binary_node *le;
Binary_node *right;
};
class Binary_tree
{
public:
Binary_tree(){root=0;};//¹¹Ô캯Êý£¬ÀïÃ潫root=NULL;
~Binary_tree(){ clear();}
void clear(){clear(root);root=0;}
//ͨ¹ý¶ÓÁÐÖб£´æµÄÊý¾Ý£¬¹¹ÔìÊ÷
void buildTree();
//±éÀú¶þ²æÊ÷
void preorder(){
Binary_node *p=root;
cout<<"Ç°ÐòÊä³ö:"<<endl;
recursive_preorder(root);
cout<<endl;
}
void inorder(){
Binary_node *p=root;
cout<<"ÖÐÐòÊä³ö:"<<endl;
recursive_inorder(p);
cout<<endl;
}
void postorder(){
Binary_node *p=root;
cout<<"ºóÐòÊä³ö:"<<endl;
recursive_postorder(p);
cout<<endl;
}
private:
//±éÀúÊ÷µÄ¸¨Öúº¯Êý
void clear(Binary_node*);
void recursive_inorder(Binary_node* );
void recursive_preorder(Binary_node* );
void recursive_postorder(Binary_node* );
评论0
最新资源