avl.h

演示了AVL的删除与插入算法

#include <iostream>
#include <stack>
#include <string>
//#include <afx.h>
using namespace std;

class Avlnode
{
	int bf;
	Avlnode *lchild,*rchild;
protected:
	std::string data;
	friend class OperationAvl;
public:
	Avlnode(){bf = 0;}
};

/*class Avl
{
	
	friend class OperationAvl;
public:
	Avl(){tree_root = NULL;}
	~Avl(){}
	Avlnode* the_node;
	std::string the_data;
	Avlnode* get_root(){return tree_root;}
};*/

class OperationAvl
{
	Avlnode *tree_root;
	stack<Avlnode*> clear;
	//friend class Avl;
protected:
	void LL(Avlnode*&p,Avlnode*&s,Avlnode*&r);
	void RR(Avlnode*&p,Avlnode*&s,Avlnode*&r);
	void LR(Avlnode*&p,Avlnode*&s,Avlnode*&r);
	void RL(Avlnode*&p,Avlnode*&s,Avlnode*&r);
public:
	OperationAvl(){tree_root = NULL;}
	~OperationAvl(){}
	bool Avl_out(std::string data);
	bool Avl_in(std::string);
	bool Avl_find(std::string data,Avlnode*& find);
	void show(Avlnode* root);
	void Avl_show();
	void mclear(Avlnode* root);
	void Avl_clear();

};