AVL树的设计

#pragma once
//#include<string>
#include<assert.h>
#include<iostream>
using namespace std;

template<class K, class V>
struct AVLTreeNode
{
	pair<K, V> _kv;
	AVLTreeNode<K, V>* _left;
	AVLTreeNode<K, V>* _right;
	AVLTreeNode<K, V>* _parent;
	int _bf;//balance factor
	AVLTreeNode(const K& k, const V& v)
		:_kv({ k,v })
		, _left(nullptr)
		, _right(nullptr)
		, _parent(nullptr)
		, _bf(0)
	{}



};

template<class K, class V>
class AVLTree
{
	typedef AVLTreeNode<K, V> Node;
public:
	bool Insert(const K& key, const V& value)
	{
		if (_root == nullptr)
		{
			_root = new Node(key, value);
			//cout << key << " " << value << endl;
			return true;
		}
		else
		{
			Node* parent = nullptr;
			Node* cur = _root;
			while (1)
			{
				if (cur->_kv.first > key)
				{

					if (cur->_left == nullptr)
					{
						cur->_left = new Node(key, value);

						parent = cur;
						cur = cur->_left;
						cur->_parent = parent;
						break;
						//cout << key << " " << value << endl;


					}
					else
					{
						cur = cur->_left;
					}
				}
				else if(cur->_kv.first < key)
				{
					if (cur->_right == nullptr)
					{
						cur->_right = new Node(key, value);
						parent = cur;
						cur = cur->_right;
						cur->_parent = parent;

						break;
						//cout << key << " " << value << endl;


					}
					else
					{
						cur = cur->_right;
					}
				}
				else {
					return false;
				}//
			}
			//cout << "已有" << endl;
			while (parent)//调整树使其重新平衡
			{
				if (cur == parent->_left)
				{
					parent->_bf--;
				}
				else
				{
					parent->_bf++;
				}

				if (parent->_bf == 0)
				{
					break;
				}
				else if (parent->_bf == 1 || parent->_bf == -1)
				{
					cur = parent;
					parent = parent->_parent;
				}
				else if (parent->_bf == 2 && cur->_bf == 1)
				{
					RotateL(parent);
					break;
				}
				else if (parent->_bf == -2 && cur->_bf == -1)
				{
					RotateR(parent);
					break;
				}
				else if (parent->_bf == 2 && cur->_bf == -1)
				{
					RotateRL(parent);
					break;
				}
				else if(parent->_bf == -2 && cur->_bf == 1)//BUG-----else后没写if出的什么币错误，编译器内部错误      方法：注释代码慢慢找 哈哈哈哈哈哈...........
				{
					RotateLR(parent);
					break;
				}
				else
				{
					assert(false);
				}
			}
			return true;

		}
	
	}


private:
	void RotateR(Node* parent)
	{
		Node* subL = parent->_left;
		Node* subLR = subL->_right;
		//三下三上
		parent->_left = subLR;
		subL->_right = parent;
		Node* parentParent = parent->_parent;
		if (subLR) subLR->_parent = parent;
		parent->_parent = subL;
		subL->_parent = parentParent;
		if (parentParent == nullptr)
		{
			_root = subL;
		}
		else
		{
			if (parentParent->_left == parent)
			{
				parentParent->_left = subL;
			}
			else
			{
				parentParent->_right = subL;

			}
		}
		subL->_bf = parent->_bf = 0;

	}

	void RotateL(Node* parent)
	{
		Node* subR = parent->_right;
		Node* subRL = subR->_left;
		//三下三上
		parent->_right = subRL;
		subR->_left = parent;
		Node* parentParent = parent->_parent;
		if (subRL) subRL->_parent = parent;
		parent->_parent = subR;
		subR->_parent = parentParent;
		if (parentParent == nullptr)
		{
			_root = subR;
		}
		else
		{
			if (parentParent->_left == parent)
			{
				parentParent->_left = subR;
			}
			else
			{
				parentParent->_right = subR;
			}
		}
		subR->_bf = parent->_bf = 0;
	}



	void RotateRL(Node* parent)
	{
		Node* subR = parent->_right;//BUG----可不能换过之后记位置，那就变过了
	   Node* subRL = subR->_left;
		RotateR(parent->_right);
		RotateL(parent);


		//抽象图分两种情况  本身是新增和不是新增
		if (bf == 0)
		{
			subR->_bf = 0;
			subRL->_bf = 0;
			parent->_bf = 0;
		}
		else if (bf == 1)
		{
			subR->_bf = 0;
			subRL->_bf = 0;
			parent->_bf = -1;
		}
		else(bf == -1)
		{
			subR->_bf = 1;
			subRL->_bf = 0;
			parent->_bf = 0;
		}

	}

	void RotateLR(Node* parent)
	{
		Node* subL = parent->_left;
		Node* subLR = subL->_right;
		RotateL(parent->_left);
		RotateR(parent);


		//抽象图分两种情况  本身是新增和不是新增
		if (subLR->_bf == -1)
		{
			subLR->_bf == 0;
			subL->_bf = 0;
			parent->_bf = 1;
		}
		else if (subLR->_bf == 1)
		{
			subL->_bf = -1;
			parent->_bf = 0;
			subLR->_bf = 0;
		}
		else
		{
			subL->_bf = 0;
			parent->_bf = 0;
			subLR->_bf = 0;
		}

	}

Node* _root = nullptr;
};

1.AVL树的节点

有三个指针，一个数据，一个平衡因子，这都没问题，但红黑树的节点只有一个模板参数也就是数据类型T，而AVL节点有两个模板参数K和V，avl树节点里数据的类型是pair<K,V>

2.AVL树

AVL树有两个模板参数K和V，K是avl树节点排序用的类型，pair<K,V>是AVL树节点里数据的类型。而红黑树有三个模板参数  红黑树节点排序所用的类型K，红黑树节点里数据的类型T， 把T变成K的仿函数类类型KeyOfT

用AVL树去适配map和set

#pragma once
#include"AVLTree.h"
namespace aqc
{
	template<class K,class V>
	class map
	{
	public:

		typedef typename AVLTree<K,V>::iterator iterator;//如果不加typename可能编译器会识别为类中的静态变量
		iterator begin()
		{
			return t.begin();
		}

		iterator end()
		{
			return t.end();
		}

		pair<iterator,bool> Insert(const pair<K,V>& kv)
		{
			 return t.Insert(kv.first,kv.second);
		}

		V& operator[](const K& key)
		{
			pair<iterator, bool> ret = Insert( {key, V()} );
			return ret.first->second;//iterator->返回的是_data的地址
		}
	private:
		AVLTree<K,V> t;
	};
}



#pragma once
#include"AVLTree.h"
namespace aqc
{
	template<class K>
	class set
	{
	public:

		typedef typename AVLTree<K, K>::iterator iterator;//set中二叉树节点的T即为key，不能被修改
		typedef typename AVLTree<K, K>::const_iterator const_iterator;

		iterator begin()
		{
			return t.begin();//普通红黑树成员调begin返普通迭代器，接受类型为:const_iterator，因此先前在红黑树加了个const迭代器构造函数
		}

		iterator end()
		{
			return t.end();
		}

		const_iterator begin()const
		{
			return t.begin();//const set调用begin：首先普通红黑树调用begin返回普通迭代器，然后接受类型构造
		}


		const_iterator end()const
		{
			return t.end();
		}

		pair<iterator,bool> Insert(const K& key)
		{
			return t.Insert(key, key);
		}
		
    private:
		AVLTree<K,K> t;
	};
}