avltree.h

平衡二叉树生成 输入任意个节点 如 2 6 8 0为显示 可自动生成平衡二叉树 bf为平衡因子 h给深度 可插入删除 计算转动次数（wangliwei007也是我

/*
*file: AVLTree.h
*date: 2004.12.9
*author: 
*description: 
*	A self-balanced tree with balance-factorial.
*	This file is the declarations of the template.
*/

#ifndef __AVLTree_h__
#define __AVLTree_h__

#include "Counter.h"
static Counter ct;

template<class KeyType>
class AVLTree
{
	public:
		AVLTree(KeyType key);
		KeyType key() const;
		void  key(KeyType);
		int insert(KeyType,AVLTree*&);
		bool del(KeyType,AVLTree*&);
		virtual ~AVLTree();
		void clearCounter();
		Counter getCounter();
		void out();
		//static int r,l;
	private:
		/*static class Counter
		{
			public:
				int r,l;
		}ct;*/
		KeyType _key;
		int _bf,h;
		AVLTree* _lChild;
		AVLTree* _rChild;
		void renodeRight(AVLTree*& Gr,AVLTree* Pr/*,AVLTree* Ch*/);
		void renodeLeft(AVLTree*& Gr,AVLTree* Pr/*,AVLTree* Ch*/);
		void lChild(AVLTree*);
		void rChild(AVLTree*);
		void delbyCopy(AVLTree*&);
		bool hasLChild();
		bool hasRChild();
		bool hasNoChildren();
		int reH();
};

#endif