template<class K, class V>
struct AVLTreeNode 
{
	AVLTreeNode<K, V>* _left; //左孩子
	AVLTreeNode<K, V>* _right; //右孩子
	AVLTreeNode<K, V>* _parent; //父親結點
	 
	pair<K, V> _Kv; //鍵值
	int _bf; //平衡因子

	//構造函數
	AVLTreeNode(const pair<K, V>& Kv)
		:_left(nullptr)
		,_right(nullptr)
		,_parent(nullptr)
		,_Kv(Kv)
		,_bf(0)
	{ }

};

template<class K, class V>
class AVLTree 
{
	typedef AVLTreeNode<K, V> Node;
public:
	AVLTree() 
		:_root(nullptr)
	{}

private:
	Node* _root;
};

bool Insert(const pair<K, V> &kv) 
	{
		if (!_root) _root = new Node(kv); //初始根節(jié)點

		Node* cur = _root;
		Node* parent = _root;
		while (cur) 
		{
			K key = cur->_Kv.first;
			if (key > kv.first) //比根結點的key值小，
			{
				parent = cur;
				cur = cur->_left;
			}
			else if(key < kv.first)//比根結點的key值大，
			{
				parent = cur;
				cur = cur->_right;
			}
			else 
			{
				return false;  //插入失敗
			}
		}
		
		//開始插入
		cur = new Node(kv);
		Node* newNode = cur;
		if (parent->_Kv.first > newNode->_Kv.first) //新插入的結點key值比根節(jié)點小就插入到左子樹
		{
			parent->_left = newNode;
			newNode->_parent = parent;
		}
		else		//新插入的結點key值比根節(jié)點大就插入到右子樹
		{
			parent->_right = newNode;
			newNode->_parent = parent;
		}
	}

//更新祖先路徑的所以結點的平衡因子
		/* 
			總結五種情況：
				1、新增結點出現在父結點的左邊，平衡因子減減
				2、新增結點出現在父結點的右邊，平衡因子加加
				3、父親的平衡因子為0就不再調整
				4、父親結點的平衡因子為1或者-1繼續(xù)調整
				5、父親結點的平衡因子為2或者-2那就旋轉
				
		*/
	while (parent) 
	{
		if (parent->_left == cur) parent->_bf--;   //1、
		if (parent->_right == cur) parent++;	   //2、
		if (parent->_bf == 0) break; 			  //3、
		if (parent->_bf == -1 || parent->_bf == 1)//4、 
		{
			cur = parent;
			parent = parent->_parent;
		}
		if (parent->_bf == -2 || parent->_bf == 2) //5、
		{
			//旋轉
			if (parent->_bf == -2) 
			{
				if (cur->_bf == -1) RotateR(parent); //左邊高，右單旋
				else RotateLR(parent); //左右雙旋
			}
			else //右 parent->_bf == 2
			{
				if (cur->_bf == 1) RotateL(parent);//右邊高左單旋轉
				else RotateRL(parent); //右左雙旋
			}

			break;
		}
	}

//右單旋
void RotateR(Node* parent) 
{
	Node* subL = parent->_left;
	Node* subLR = subL->_right;

	parent->_left = subLR; 
	if (subLR) subLR->_parent = parent;  //防止subLR為nullptr

	subL->_right = parent;
	Node* parent_parent = parent->_p	arent; //指針備份
	parent->_parent = subL;
	if (_root == parent) //如果parent就是樹的根 
	{
		_root = subL;  //subL取代parent
		_root->_parent = nullptr;
	}
	else  //如果parent并不是樹的根
	{
		if (parent_parent->_left == parent) parent->_left = subL;
		else parent_parent->_right = subL;

		subL->_parent = parent_parent; //subL去做parent_parent的孩子
	}
	//調節(jié)平衡因子
	subL->_bf = parent->_bf = 0;
}

//左單旋
void RotateL(Node* parent) 
{
	Node* subR = parent->_right;
	Node* subRL = subR->_left;
	
	parent->_right = subRL;
	if (subRL) subRL->_parent = parent;
	
	subR->_left = parent;
	Node* parent_parent = parent->_parent;
	parent->_parent = subR;
	
	if (_root == parent) 
	{
		_root = subR;
		_root->_parent = nullptr;
	}
	else  
	{
		if (parent_parent->_left == parent) parent_parent->_left = subR;
		else parent_parent->_right = subR;

		subR->_parent = parent_parent;
	}
	subR->_bf = parent->_bf = 0;
}

//左右旋轉
	void RotateLR(Node* parent) 
	{
		Node* subL = parent->_left;
		Node* subLR = subL->_right;
		int bf = subLR->_bf;

		RotateL(parent->_left);
		RotateR(parent);
		if (bf == -1)  //h > 0，新增結點在b
		{
			parent->_bf = 1;
			subLR->_bf = 0;
			subL->_bf = 0;
		}
		else if (bf == 1) //h > 0，新增結點在c
		{
			subL->_bf = -1;
			subLR->_bf = 0;
			parent->_bf = 0;
		}
		else if(bf == 0) //h = 0
		{
			parent->_bf = 0;
			subLR->_bf = 0;
			subL->_bf = 0;
		}
		
	}

	//右左旋轉
	void RotateRL(Node* parent)
	{
		Node* subR = parent->_right;
		Node* subRL = subR->_left;
		int bf = subRL->_bf;

		RotateR(parent->_right);
		RotateL(parent);
		if (bf == -1)  //h > 0，新增結點在b
		{
			parent->_bf = 0;
			subR->_bf = 1;
			subRL->_bf = 0;
		}
		else if (bf == 1) //h > 0，新增結點在c
		{
			parent->_bf = -1;
			subR->_bf = 0;
			subRL->_bf = 0;
		}
		else if (bf == 0)//h = 0
		{
			subR->_bf = 0;
			subRL->_bf = 0;
			parent->_bf = 0;
		}

	}

Node* Find(const K& key) 
{
	Node* cur = _root;
	while (cur) 
	{
		if (key > cur->_Kv.first) cur = cur->_right; //左子樹
		else if (key < cur->_Kv.first) cur = cur->_left; //右子樹
		else return cur;
	}
}

int height(Node* root) //求高度
{
	return !root ? 0 
		   : max(height(root->_left), 
			 height(root->_right)) + 1;
}

void _Inorder(Node* root)//中序遍歷 
{
	if (!root) return;
	_Inorder(root->_left);
	printf("%d : %d\n",root->_Kv.first, root->_Kv.second);
	_Inorder(root->_right);
}

//判斷是不是平衡二叉樹
bool IsAVLTree() 
{
	return _IsAVLTree(_root);
}

bool _IsAVLTree(Node* root)
{
	if (!root) return true;
	int left = height(root->_left);
	int right = height(root->_right);
	//檢查平衡因子	
	if (right - left != root->_bf)
	{
		printf("錯誤的平衡因子 %d :%d\n", root->_Kv.first, root->_Kv.second);
		return false;
	}
	return (abs(right - left) < 2)
		&& _IsAVLTree(root->_left)
		&& _IsAVLTree(root->_right);
}

//析構函數
~AVLTree()
{
	Destroy(_root);
	_root = nullptr;
}

void Destroy(Node *root)//后序銷毀結點
{
	if (!root) return;
	Destroy(root->_left);
	Destroy(root->_right);
	delete root;
}

Node* copy(Node* cp)
{
	if (!cp) return nullptr;

	Node* newnode = new Node(cp->_Kv);
	newnode->_left = copy(cp->_left);
	newnode->_right = copy(cp->_right);
	return newnode;
}

//拷貝構造
AVLTree(const AVLTree<K, V>& job)
{
	if(&job != this)
	_root = copy(job._root);
}

void operator=(AVLTree<K, V> tmp)
{
	if (&tmp != this)
	swap(tmp._root, this->_root);
}

V& operator[](const K& key)
{
	return (Insert(make_pair(key, V())).first)->_Kv.second;
}