AVL Tree 平衡二叉树基本插入删除节点功能的实现 .
2013-12-25 19:42
495 查看
简述：
实现AVL 树，主要是两个功能 ： 插入某节点和删除某节点
AVL Tree的定义，
1. 是一棵二叉搜索树（故而每个节点是惟一的, 如果出现重复数字会破坏平衡树的算法）
2. 每个节点左右子树的高度之差（平衡因子）相差最多为1
实现：
为了使所得的二叉树为平衡二叉树，
首先在BSTNode中加了一个计算节点高度的方法getHeight()， 当两个节点高度相差2的时候，视为平衡破坏
[cpp]
view plaincopyprint?
int getHeight(){
if(this == NULL)
return 0;
if(left == NULL && right == NULL)
return 1;
else{
return 1 + max(left->getHeight(), right->getHeight());
}
}
之后讨论一下，不平衡出现的四种情况, 新增节点（红色）
1） LL， 新建在左子树的左节点上
LL代码实现：
[cpp]
view plaincopyprint?
template<class Type> BSTNode<Type>* AVLTree<Type>::LL(BSTNode<Type>* &topNode){ BSTNode<Type> * leftSonNode = topNode->left; topNode->left = leftSonNode->right; leftSonNode->right = topNode; return leftSonNode; }
2） RR， 新建在右子树的右节点上
RR代码实现：
[cpp]
view plaincopyprint?
template<class Type> BSTNode<Type>* AVLTree<Type>::RR(BSTNode<Type>* &topNode){ BSTNode<Type> *rightSonNode = topNode->right; topNode->right = rightSonNode->left; rightSonNode->left = topNode; return rightSonNode; }
3） LR， 新建在左子树的右节点上
LR代码实现：
[cpp]
view plaincopyprint?
template<class Type> BSTNode<Type>* AVLTree<Type>::LR(BSTNode<Type>* &topNode){ topNode->left = RR(topNode->left); return LL(topNode); }
4） RL， 新建在右子树的左节点上
RL代码实现：
[cpp]
view plaincopyprint?
template<class Type> BSTNode<Type>* AVLTree<Type>::RL(BSTNode<Type>* &topNode){ topNode->right = LL(topNode->right); return RR(topNode); }
对于删除操作，每一次删除一个节点之后，优先考虑其子节点的最左节点的值替换删除节点，但是需要注意的是，
在替换之后需要自修改节点向下每个节点做Rotate操作，用来处理因为删除某个节点之后平衡树的破坏
下面是Delete函数的实现：
[cpp]
view plaincopyprint?
template<class Type> BSTNode<Type>* AVLTree<Type>::Delete(const Type& key){ return root = Delete(root, key); } template<class Type> BSTNode<Type>* AVLTree<Type>::Delete(BSTNode<Type>* &node, const Type &key){ if(node == NULL){ return NULL; } /** * if we find the matched key, * delete the matched node and replace it by the most left node * of its right child */ else if(key == node->key){ if(!node->right){ BSTNode<Type> *newNode = node->left; delete node; return newNode; }else{ BSTNode<Type> *secondMostLeftNode = node->right; if(secondMostLeftNode->left == NULL){ return secondMostLeftNode; } while(secondMostLeftNode->left->left) secondMostLeftNode = secondMostLeftNode->left; BSTNode<Type> *mostLeftNode = secondMostLeftNode->left; secondMostLeftNode->left->left = node->left; secondMostLeftNode->left->right = node->right; secondMostLeftNode->left = NULL; return mostLeftNode; } } //from bottom to the top else if(key < node->key){ node->left = Delete(node->left, key); } else{ node->right = Delete(node->right, key); } if(node->left) node->left = Rotate(node->left); if(node->right) node->right = Rotate(node->right); node = Rotate(node); return node; } /** * Rotate one node and its sub tree */ template<class Type> BSTNode<Type>* AVLTree<Type>::Rotate(BSTNode<Type>* node){ if(node->left->getHeight() - node->right->getHeight() == 2){ if(node->left->left->getHeight() >= node->left->right->getHeight()) node = LL(node); else node = LR(node); } if(node->right->getHeight() - node->left->getHeight() == 2){ if(node->right->right->getHeight() >= node->right->left->getHeight()) node = RR(node); else node = RL(node); } return node; }
之后是整个平衡树插入删除节点实现以及在main函数中测试的代码：
[cpp]
view plaincopyprint?
#include <iostream>
#include <ctime>
#include <cstdlib>
using namespace std;
template<class Type>
class AVLTree;
/**
* Binary Search Tree Node: BSTNode class
*/
template<class Type>
class BSTNode{
friend class AVLTree<Type>;
private:
Type key;
BSTNode *left;
BSTNode *right;
public:
BSTNode(): left(NULL), right(NULL){}
BSTNode(const Type& key): key(key), left(NULL), right(NULL){}
Type getkey(){return key;}
int getHeight(){
if(this == NULL)
return 0;
if(left == NULL && right == NULL)
return 1;
else{
return 1 + max(left->getHeight(), right->getHeight());
}
}
void clear(){
if(this == NULL)
return;
left->clear();
right->clear();
delete this;
}
void Output_DLR(){ //Node -> left -> Right order
if(this != NULL){
cout << key << ", ";
left->Output_DLR();
right->Output_DLR();
}
}
};
/**
* AVLTree class
*/
template<class Type>
class AVLTree{
private:
BSTNode<Type> *root;
public:
AVLTree(): root(NULL){}
BSTNode<Type>* Insert(BSTNode<Type>* &, const Type&);
BSTNode<Type>* Insert(const Type& );
BSTNode<Type>* Delete(BSTNode<Type>* &, const Type&);
BSTNode<Type>* Delete(const Type& );
BSTNode<Type>* Rotate(BSTNode<Type>* );
BSTNode<Type>* GetRoot();
BSTNode<Type>* LL(BSTNode<Type>* &);
BSTNode<Type>* LR(BSTNode<Type>* &);
BSTNode<Type>* RL(BSTNode<Type>* &);
BSTNode<Type>* RR(BSTNode<Type>* &);
void Clear();
void Output_DLR();
void Output_LRN();
};
template<class Type> BSTNode<Type>* AVLTree<Type>::LL(BSTNode<Type>* &topNode){ BSTNode<Type> * leftSonNode = topNode->left; topNode->left = leftSonNode->right; leftSonNode->right = topNode; return leftSonNode; }
template<class Type> BSTNode<Type>* AVLTree<Type>::RR(BSTNode<Type>* &topNode){ BSTNode<Type> *rightSonNode = topNode->right; topNode->right = rightSonNode->left; rightSonNode->left = topNode; return rightSonNode; }
template<class Type> BSTNode<Type>* AVLTree<Type>::LR(BSTNode<Type>* &topNode){ topNode->left = RR(topNode->left); return LL(topNode); }
template<class Type> BSTNode<Type>* AVLTree<Type>::RL(BSTNode<Type>* &topNode){ topNode->right = LL(topNode->right); return RR(topNode); }
template<class Type>
BSTNode<Type>* AVLTree<Type>::GetRoot(){
return root;
}
template<class Type>
BSTNode<Type>* AVLTree<Type>::Insert(const Type& key){
return Insert(root, key);
}
template<class Type>
BSTNode<Type>* AVLTree<Type>::Insert(BSTNode<Type>* &node, const Type &key){
if(node == NULL){
return node = new BSTNode<Type>(key);
}
//from bottom to the top
else if(key < node->key){
Insert(node->left, key);
if(node->left->getHeight() - node->right->getHeight() == 2){
if(key < node->left->key)
node = LL(node);
else
node = LR(node);
}
}
else{
Insert(node->right, key);
if(node->right->getHeight() - node->left->getHeight() == 2){
if(key > node->right->key)
node = RR(node);
else
node = RL(node);
}
}
return node;
}
template<class Type> BSTNode<Type>* AVLTree<Type>::Delete(const Type& key){ return root = Delete(root, key); } template<class Type> BSTNode<Type>* AVLTree<Type>::Delete(BSTNode<Type>* &node, const Type &key){ if(node == NULL){ return NULL; } /** * if we find the matched key, * delete the matched node and replace it by the most left node * of its right child */ else if(key == node->key){ if(!node->right){ BSTNode<Type> *newNode = node->left; delete node; return newNode; }else{ BSTNode<Type> *secondMostLeftNode = node->right; if(secondMostLeftNode->left == NULL){ return secondMostLeftNode; } while(secondMostLeftNode->left->left) secondMostLeftNode = secondMostLeftNode->left; BSTNode<Type> *mostLeftNode = secondMostLeftNode->left; secondMostLeftNode->left->left = node->left; secondMostLeftNode->left->right = node->right; secondMostLeftNode->left = NULL; return mostLeftNode; } } //from bottom to the top else if(key < node->key){ node->left = Delete(node->left, key); } else{ node->right = Delete(node->right, key); } if(node->left) node->left = Rotate(node->left); if(node->right) node->right = Rotate(node->right); node = Rotate(node); return node; } /** * Rotate one node and its sub tree */ template<class Type> BSTNode<Type>* AVLTree<Type>::Rotate(BSTNode<Type>* node){ if(node->left->getHeight() - node->right->getHeight() == 2){ if(node->left->left->getHeight() >= node->left->right->getHeight()) node = LL(node); else node = LR(node); } if(node->right->getHeight() - node->left->getHeight() == 2){ if(node->right->right->getHeight() >= node->right->left->getHeight()) node = RR(node); else node = RL(node); } return node; }
template<class Type>
void AVLTree<Type>::Clear(){
root->clear();
root = NULL;
}
template<class Type>
void AVLTree<Type>::Output_DLR(){
if(!root)
cout << "EMPTY TREE! " << endl;
else
root->Output_DLR();
}
template<class Type>
void AVLTree<Type>::Output_LRN(){
if(!root)
cout << "EMPTY TREE! " << endl;
else
root->Output_LRN();
}
//Test Main
int main() {
AVLTree<int> *tree = new AVLTree<int>();
cout << "First, Test Insert(key) funciton: " << endl;
cout << "Test LL : " << endl;
//test LL
tree->Insert(8);
tree->Insert(6);
tree->Insert(11);
tree->Insert(4);
tree->Insert(7);
tree->Insert(2);
cout << "DLR Output LL: " << endl;
tree->GetRoot()->Output_DLR();
tree->Clear();
//test RR
cout << endl << endl << "Test RR : " << endl;
tree->Insert(8);
tree->Insert(6);
tree->Insert(10);
tree->Insert(9);
tree->Insert(12);
tree->Insert(14);
cout << "DLR Output RR: " << endl;
tree->GetRoot()->Output_DLR();
tree->Clear();
//test LR
cout << endl << endl << "Test LR : " << endl;
tree->Insert(9);
tree->Insert(6);
tree->Insert(11);
tree->Insert(4);
tree->Insert(7);
tree->Insert(8);
cout << "DLR Output LR: " << endl;
tree->GetRoot()->Output_DLR();
tree->Clear();
//test RL
cout << endl << endl << "Test RL : " << endl;
tree->Insert(6);
tree->Insert(4);
tree->Insert(12);
tree->Insert(10);
tree->Insert(14);
tree->Insert(8);
cout << "DLR Output RL: " << endl;
tree->GetRoot()->Output_DLR();
tree->Clear();
//test Delete(const Type& )
cout << endl << endl << "Test Delete : " << endl;
tree->Insert(6);
tree->Insert(7);
tree->Insert(9);
tree->Insert(13);
tree->Insert(15);
tree->Insert(4);
tree->Insert(5);
tree->Insert(17);
tree->Insert(19);
tree->Insert(12);
tree->Insert(10);
tree->Insert(14);
tree->Insert(8);
cout << "DLR Output Before Delete: " << endl;
tree->Output_DLR();
tree->Delete(7);
cout << endl << "DLR Output After Delete: " << endl;
tree->Output_DLR();
tree->Clear();
return 0;
}
测试输出：
对于最后的测试Delete的结果，平衡树的改变可以观察下面这副，数据是相同的
http://blog.csdn.net/anialy/article/details/7985165
实现AVL 树，主要是两个功能 ： 插入某节点和删除某节点
AVL Tree的定义，
1. 是一棵二叉搜索树（故而每个节点是惟一的, 如果出现重复数字会破坏平衡树的算法）
2. 每个节点左右子树的高度之差（平衡因子）相差最多为1
实现：
为了使所得的二叉树为平衡二叉树，
首先在BSTNode中加了一个计算节点高度的方法getHeight()， 当两个节点高度相差2的时候，视为平衡破坏
[cpp]
view plaincopyprint?
int getHeight(){
if(this == NULL)
return 0;
if(left == NULL && right == NULL)
return 1;
else{
return 1 + max(left->getHeight(), right->getHeight());
}
}
int getHeight(){
if(this == NULL)
return 0;
if(left == NULL && right == NULL)
return 1;
else{
return 1 + max(left->getHeight(), right->getHeight());
}
}之后讨论一下，不平衡出现的四种情况, 新增节点（红色）
1） LL， 新建在左子树的左节点上
LL代码实现：
[cpp]
view plaincopyprint?
template<class Type> BSTNode<Type>* AVLTree<Type>::LL(BSTNode<Type>* &topNode){ BSTNode<Type> * leftSonNode = topNode->left; topNode->left = leftSonNode->right; leftSonNode->right = topNode; return leftSonNode; }
template<class Type>
BSTNode<Type>* AVLTree<Type>::LL(BSTNode<Type>* &topNode){
BSTNode<Type> * leftSonNode = topNode->left;
topNode->left = leftSonNode->right;
leftSonNode->right = topNode;
return leftSonNode;
}2） RR， 新建在右子树的右节点上
RR代码实现：
[cpp]
view plaincopyprint?
template<class Type> BSTNode<Type>* AVLTree<Type>::RR(BSTNode<Type>* &topNode){ BSTNode<Type> *rightSonNode = topNode->right; topNode->right = rightSonNode->left; rightSonNode->left = topNode; return rightSonNode; }
template<class Type>
BSTNode<Type>* AVLTree<Type>::RR(BSTNode<Type>* &topNode){
BSTNode<Type> *rightSonNode = topNode->right;
topNode->right = rightSonNode->left;
rightSonNode->left = topNode;
return rightSonNode;
}3） LR， 新建在左子树的右节点上
LR代码实现：
[cpp]
view plaincopyprint?
template<class Type> BSTNode<Type>* AVLTree<Type>::LR(BSTNode<Type>* &topNode){ topNode->left = RR(topNode->left); return LL(topNode); }
template<class Type>
BSTNode<Type>* AVLTree<Type>::LR(BSTNode<Type>* &topNode){
topNode->left = RR(topNode->left);
return LL(topNode);
}4） RL， 新建在右子树的左节点上
RL代码实现：
[cpp]
view plaincopyprint?
template<class Type> BSTNode<Type>* AVLTree<Type>::RL(BSTNode<Type>* &topNode){ topNode->right = LL(topNode->right); return RR(topNode); }
template<class Type>
BSTNode<Type>* AVLTree<Type>::RL(BSTNode<Type>* &topNode){
topNode->right = LL(topNode->right);
return RR(topNode);
}对于删除操作，每一次删除一个节点之后，优先考虑其子节点的最左节点的值替换删除节点，但是需要注意的是，
在替换之后需要自修改节点向下每个节点做Rotate操作，用来处理因为删除某个节点之后平衡树的破坏
下面是Delete函数的实现：
[cpp]
view plaincopyprint?
template<class Type> BSTNode<Type>* AVLTree<Type>::Delete(const Type& key){ return root = Delete(root, key); } template<class Type> BSTNode<Type>* AVLTree<Type>::Delete(BSTNode<Type>* &node, const Type &key){ if(node == NULL){ return NULL; } /** * if we find the matched key, * delete the matched node and replace it by the most left node * of its right child */ else if(key == node->key){ if(!node->right){ BSTNode<Type> *newNode = node->left; delete node; return newNode; }else{ BSTNode<Type> *secondMostLeftNode = node->right; if(secondMostLeftNode->left == NULL){ return secondMostLeftNode; } while(secondMostLeftNode->left->left) secondMostLeftNode = secondMostLeftNode->left; BSTNode<Type> *mostLeftNode = secondMostLeftNode->left; secondMostLeftNode->left->left = node->left; secondMostLeftNode->left->right = node->right; secondMostLeftNode->left = NULL; return mostLeftNode; } } //from bottom to the top else if(key < node->key){ node->left = Delete(node->left, key); } else{ node->right = Delete(node->right, key); } if(node->left) node->left = Rotate(node->left); if(node->right) node->right = Rotate(node->right); node = Rotate(node); return node; } /** * Rotate one node and its sub tree */ template<class Type> BSTNode<Type>* AVLTree<Type>::Rotate(BSTNode<Type>* node){ if(node->left->getHeight() - node->right->getHeight() == 2){ if(node->left->left->getHeight() >= node->left->right->getHeight()) node = LL(node); else node = LR(node); } if(node->right->getHeight() - node->left->getHeight() == 2){ if(node->right->right->getHeight() >= node->right->left->getHeight()) node = RR(node); else node = RL(node); } return node; }
template<class Type>
BSTNode<Type>* AVLTree<Type>::Delete(const Type& key){
return root = Delete(root, key);
}
template<class Type>
BSTNode<Type>* AVLTree<Type>::Delete(BSTNode<Type>* &node, const Type &key){
if(node == NULL){
return NULL;
}
/**
* if we find the matched key,
* delete the matched node and replace it by the most left node
* of its right child
*/
else if(key == node->key){
if(!node->right){
BSTNode<Type> *newNode = node->left;
delete node;
return newNode;
}else{
BSTNode<Type> *secondMostLeftNode = node->right;
if(secondMostLeftNode->left == NULL){
return secondMostLeftNode;
}
while(secondMostLeftNode->left->left)
secondMostLeftNode = secondMostLeftNode->left;
BSTNode<Type> *mostLeftNode = secondMostLeftNode->left;
secondMostLeftNode->left->left = node->left;
secondMostLeftNode->left->right = node->right;
secondMostLeftNode->left = NULL;
return mostLeftNode;
}
}
//from bottom to the top
else if(key < node->key){
node->left = Delete(node->left, key);
}
else{
node->right = Delete(node->right, key);
}
if(node->left)
node->left = Rotate(node->left);
if(node->right)
node->right = Rotate(node->right);
node = Rotate(node);
return node;
}
/**
* Rotate one node and its sub tree
*/
template<class Type>
BSTNode<Type>* AVLTree<Type>::Rotate(BSTNode<Type>* node){
if(node->left->getHeight() - node->right->getHeight() == 2){
if(node->left->left->getHeight() >= node->left->right->getHeight())
node = LL(node);
else
node = LR(node);
}
if(node->right->getHeight() - node->left->getHeight() == 2){
if(node->right->right->getHeight() >= node->right->left->getHeight())
node = RR(node);
else
node = RL(node);
}
return node;
}之后是整个平衡树插入删除节点实现以及在main函数中测试的代码：
[cpp]
view plaincopyprint?
#include <iostream>
#include <ctime>
#include <cstdlib>
using namespace std;
template<class Type>
class AVLTree;
/**
* Binary Search Tree Node: BSTNode class
*/
template<class Type>
class BSTNode{
friend class AVLTree<Type>;
private:
Type key;
BSTNode *left;
BSTNode *right;
public:
BSTNode(): left(NULL), right(NULL){}
BSTNode(const Type& key): key(key), left(NULL), right(NULL){}
Type getkey(){return key;}
int getHeight(){
if(this == NULL)
return 0;
if(left == NULL && right == NULL)
return 1;
else{
return 1 + max(left->getHeight(), right->getHeight());
}
}
void clear(){
if(this == NULL)
return;
left->clear();
right->clear();
delete this;
}
void Output_DLR(){ //Node -> left -> Right order
if(this != NULL){
cout << key << ", ";
left->Output_DLR();
right->Output_DLR();
}
}
};
/**
* AVLTree class
*/
template<class Type>
class AVLTree{
private:
BSTNode<Type> *root;
public:
AVLTree(): root(NULL){}
BSTNode<Type>* Insert(BSTNode<Type>* &, const Type&);
BSTNode<Type>* Insert(const Type& );
BSTNode<Type>* Delete(BSTNode<Type>* &, const Type&);
BSTNode<Type>* Delete(const Type& );
BSTNode<Type>* Rotate(BSTNode<Type>* );
BSTNode<Type>* GetRoot();
BSTNode<Type>* LL(BSTNode<Type>* &);
BSTNode<Type>* LR(BSTNode<Type>* &);
BSTNode<Type>* RL(BSTNode<Type>* &);
BSTNode<Type>* RR(BSTNode<Type>* &);
void Clear();
void Output_DLR();
void Output_LRN();
};
template<class Type> BSTNode<Type>* AVLTree<Type>::LL(BSTNode<Type>* &topNode){ BSTNode<Type> * leftSonNode = topNode->left; topNode->left = leftSonNode->right; leftSonNode->right = topNode; return leftSonNode; }
template<class Type> BSTNode<Type>* AVLTree<Type>::RR(BSTNode<Type>* &topNode){ BSTNode<Type> *rightSonNode = topNode->right; topNode->right = rightSonNode->left; rightSonNode->left = topNode; return rightSonNode; }
template<class Type> BSTNode<Type>* AVLTree<Type>::LR(BSTNode<Type>* &topNode){ topNode->left = RR(topNode->left); return LL(topNode); }
template<class Type> BSTNode<Type>* AVLTree<Type>::RL(BSTNode<Type>* &topNode){ topNode->right = LL(topNode->right); return RR(topNode); }
template<class Type>
BSTNode<Type>* AVLTree<Type>::GetRoot(){
return root;
}
template<class Type>
BSTNode<Type>* AVLTree<Type>::Insert(const Type& key){
return Insert(root, key);
}
template<class Type>
BSTNode<Type>* AVLTree<Type>::Insert(BSTNode<Type>* &node, const Type &key){
if(node == NULL){
return node = new BSTNode<Type>(key);
}
//from bottom to the top
else if(key < node->key){
Insert(node->left, key);
if(node->left->getHeight() - node->right->getHeight() == 2){
if(key < node->left->key)
node = LL(node);
else
node = LR(node);
}
}
else{
Insert(node->right, key);
if(node->right->getHeight() - node->left->getHeight() == 2){
if(key > node->right->key)
node = RR(node);
else
node = RL(node);
}
}
return node;
}
template<class Type> BSTNode<Type>* AVLTree<Type>::Delete(const Type& key){ return root = Delete(root, key); } template<class Type> BSTNode<Type>* AVLTree<Type>::Delete(BSTNode<Type>* &node, const Type &key){ if(node == NULL){ return NULL; } /** * if we find the matched key, * delete the matched node and replace it by the most left node * of its right child */ else if(key == node->key){ if(!node->right){ BSTNode<Type> *newNode = node->left; delete node; return newNode; }else{ BSTNode<Type> *secondMostLeftNode = node->right; if(secondMostLeftNode->left == NULL){ return secondMostLeftNode; } while(secondMostLeftNode->left->left) secondMostLeftNode = secondMostLeftNode->left; BSTNode<Type> *mostLeftNode = secondMostLeftNode->left; secondMostLeftNode->left->left = node->left; secondMostLeftNode->left->right = node->right; secondMostLeftNode->left = NULL; return mostLeftNode; } } //from bottom to the top else if(key < node->key){ node->left = Delete(node->left, key); } else{ node->right = Delete(node->right, key); } if(node->left) node->left = Rotate(node->left); if(node->right) node->right = Rotate(node->right); node = Rotate(node); return node; } /** * Rotate one node and its sub tree */ template<class Type> BSTNode<Type>* AVLTree<Type>::Rotate(BSTNode<Type>* node){ if(node->left->getHeight() - node->right->getHeight() == 2){ if(node->left->left->getHeight() >= node->left->right->getHeight()) node = LL(node); else node = LR(node); } if(node->right->getHeight() - node->left->getHeight() == 2){ if(node->right->right->getHeight() >= node->right->left->getHeight()) node = RR(node); else node = RL(node); } return node; }
template<class Type>
void AVLTree<Type>::Clear(){
root->clear();
root = NULL;
}
template<class Type>
void AVLTree<Type>::Output_DLR(){
if(!root)
cout << "EMPTY TREE! " << endl;
else
root->Output_DLR();
}
template<class Type>
void AVLTree<Type>::Output_LRN(){
if(!root)
cout << "EMPTY TREE! " << endl;
else
root->Output_LRN();
}
//Test Main
int main() {
AVLTree<int> *tree = new AVLTree<int>();
cout << "First, Test Insert(key) funciton: " << endl;
cout << "Test LL : " << endl;
//test LL
tree->Insert(8);
tree->Insert(6);
tree->Insert(11);
tree->Insert(4);
tree->Insert(7);
tree->Insert(2);
cout << "DLR Output LL: " << endl;
tree->GetRoot()->Output_DLR();
tree->Clear();
//test RR
cout << endl << endl << "Test RR : " << endl;
tree->Insert(8);
tree->Insert(6);
tree->Insert(10);
tree->Insert(9);
tree->Insert(12);
tree->Insert(14);
cout << "DLR Output RR: " << endl;
tree->GetRoot()->Output_DLR();
tree->Clear();
//test LR
cout << endl << endl << "Test LR : " << endl;
tree->Insert(9);
tree->Insert(6);
tree->Insert(11);
tree->Insert(4);
tree->Insert(7);
tree->Insert(8);
cout << "DLR Output LR: " << endl;
tree->GetRoot()->Output_DLR();
tree->Clear();
//test RL
cout << endl << endl << "Test RL : " << endl;
tree->Insert(6);
tree->Insert(4);
tree->Insert(12);
tree->Insert(10);
tree->Insert(14);
tree->Insert(8);
cout << "DLR Output RL: " << endl;
tree->GetRoot()->Output_DLR();
tree->Clear();
//test Delete(const Type& )
cout << endl << endl << "Test Delete : " << endl;
tree->Insert(6);
tree->Insert(7);
tree->Insert(9);
tree->Insert(13);
tree->Insert(15);
tree->Insert(4);
tree->Insert(5);
tree->Insert(17);
tree->Insert(19);
tree->Insert(12);
tree->Insert(10);
tree->Insert(14);
tree->Insert(8);
cout << "DLR Output Before Delete: " << endl;
tree->Output_DLR();
tree->Delete(7);
cout << endl << "DLR Output After Delete: " << endl;
tree->Output_DLR();
tree->Clear();
return 0;
}
#include <iostream>
#include <ctime>
#include <cstdlib>
using namespace std;
template<class Type>
class AVLTree;
/**
* Binary Search Tree Node: BSTNode class
*/
template<class Type>
class BSTNode{
friend class AVLTree<Type>;
private:
Type key;
BSTNode *left;
BSTNode *right;
public:
BSTNode(): left(NULL), right(NULL){}
BSTNode(const Type& key): key(key), left(NULL), right(NULL){}
Type getkey(){return key;}
int getHeight(){ if(this == NULL) return 0; if(left == NULL && right == NULL) return 1; else{ return 1 + max(left->getHeight(), right->getHeight()); } }
void clear(){
if(this == NULL)
return;
left->clear();
right->clear();
delete this;
}
void Output_DLR(){ //Node -> left -> Right order
if(this != NULL){
cout << key << ", ";
left->Output_DLR();
right->Output_DLR();
}
}
};
/**
* AVLTree class
*/
template<class Type>
class AVLTree{
private:
BSTNode<Type> *root;
public:
AVLTree(): root(NULL){}
BSTNode<Type>* Insert(BSTNode<Type>* &, const Type&);
BSTNode<Type>* Insert(const Type& );
BSTNode<Type>* Delete(BSTNode<Type>* &, const Type&);
BSTNode<Type>* Delete(const Type& );
BSTNode<Type>* Rotate(BSTNode<Type>* );
BSTNode<Type>* GetRoot();
BSTNode<Type>* LL(BSTNode<Type>* &);
BSTNode<Type>* LR(BSTNode<Type>* &);
BSTNode<Type>* RL(BSTNode<Type>* &);
BSTNode<Type>* RR(BSTNode<Type>* &);
void Clear();
void Output_DLR();
void Output_LRN();
};
template<class Type> BSTNode<Type>* AVLTree<Type>::LL(BSTNode<Type>* &topNode){ BSTNode<Type> * leftSonNode = topNode->left; topNode->left = leftSonNode->right; leftSonNode->right = topNode; return leftSonNode; }
template<class Type> BSTNode<Type>* AVLTree<Type>::RR(BSTNode<Type>* &topNode){ BSTNode<Type> *rightSonNode = topNode->right; topNode->right = rightSonNode->left; rightSonNode->left = topNode; return rightSonNode; }
template<class Type> BSTNode<Type>* AVLTree<Type>::LR(BSTNode<Type>* &topNode){ topNode->left = RR(topNode->left); return LL(topNode); }
template<class Type> BSTNode<Type>* AVLTree<Type>::RL(BSTNode<Type>* &topNode){ topNode->right = LL(topNode->right); return RR(topNode); }
template<class Type>
BSTNode<Type>* AVLTree<Type>::GetRoot(){
return root;
}
template<class Type>
BSTNode<Type>* AVLTree<Type>::Insert(const Type& key){
return Insert(root, key);
}
template<class Type>
BSTNode<Type>* AVLTree<Type>::Insert(BSTNode<Type>* &node, const Type &key){
if(node == NULL){
return node = new BSTNode<Type>(key);
}
//from bottom to the top
else if(key < node->key){
Insert(node->left, key);
if(node->left->getHeight() - node->right->getHeight() == 2){
if(key < node->left->key)
node = LL(node);
else
node = LR(node);
}
}
else{
Insert(node->right, key);
if(node->right->getHeight() - node->left->getHeight() == 2){
if(key > node->right->key)
node = RR(node);
else
node = RL(node);
}
}
return node;
}
template<class Type> BSTNode<Type>* AVLTree<Type>::Delete(const Type& key){ return root = Delete(root, key); } template<class Type> BSTNode<Type>* AVLTree<Type>::Delete(BSTNode<Type>* &node, const Type &key){ if(node == NULL){ return NULL; } /** * if we find the matched key, * delete the matched node and replace it by the most left node * of its right child */ else if(key == node->key){ if(!node->right){ BSTNode<Type> *newNode = node->left; delete node; return newNode; }else{ BSTNode<Type> *secondMostLeftNode = node->right; if(secondMostLeftNode->left == NULL){ return secondMostLeftNode; } while(secondMostLeftNode->left->left) secondMostLeftNode = secondMostLeftNode->left; BSTNode<Type> *mostLeftNode = secondMostLeftNode->left; secondMostLeftNode->left->left = node->left; secondMostLeftNode->left->right = node->right; secondMostLeftNode->left = NULL; return mostLeftNode; } } //from bottom to the top else if(key < node->key){ node->left = Delete(node->left, key); } else{ node->right = Delete(node->right, key); } if(node->left) node->left = Rotate(node->left); if(node->right) node->right = Rotate(node->right); node = Rotate(node); return node; } /** * Rotate one node and its sub tree */ template<class Type> BSTNode<Type>* AVLTree<Type>::Rotate(BSTNode<Type>* node){ if(node->left->getHeight() - node->right->getHeight() == 2){ if(node->left->left->getHeight() >= node->left->right->getHeight()) node = LL(node); else node = LR(node); } if(node->right->getHeight() - node->left->getHeight() == 2){ if(node->right->right->getHeight() >= node->right->left->getHeight()) node = RR(node); else node = RL(node); } return node; }
template<class Type>
void AVLTree<Type>::Clear(){
root->clear();
root = NULL;
}
template<class Type>
void AVLTree<Type>::Output_DLR(){
if(!root)
cout << "EMPTY TREE! " << endl;
else
root->Output_DLR();
}
template<class Type>
void AVLTree<Type>::Output_LRN(){
if(!root)
cout << "EMPTY TREE! " << endl;
else
root->Output_LRN();
}
//Test Main
int main() {
AVLTree<int> *tree = new AVLTree<int>();
cout << "First, Test Insert(key) funciton: " << endl;
cout << "Test LL : " << endl;
//test LL
tree->Insert(8);
tree->Insert(6);
tree->Insert(11);
tree->Insert(4);
tree->Insert(7);
tree->Insert(2);
cout << "DLR Output LL: " << endl;
tree->GetRoot()->Output_DLR();
tree->Clear();
//test RR
cout << endl << endl << "Test RR : " << endl;
tree->Insert(8);
tree->Insert(6);
tree->Insert(10);
tree->Insert(9);
tree->Insert(12);
tree->Insert(14);
cout << "DLR Output RR: " << endl;
tree->GetRoot()->Output_DLR();
tree->Clear();
//test LR
cout << endl << endl << "Test LR : " << endl;
tree->Insert(9);
tree->Insert(6);
tree->Insert(11);
tree->Insert(4);
tree->Insert(7);
tree->Insert(8);
cout << "DLR Output LR: " << endl;
tree->GetRoot()->Output_DLR();
tree->Clear();
//test RL
cout << endl << endl << "Test RL : " << endl;
tree->Insert(6);
tree->Insert(4);
tree->Insert(12);
tree->Insert(10);
tree->Insert(14);
tree->Insert(8);
cout << "DLR Output RL: " << endl;
tree->GetRoot()->Output_DLR();
tree->Clear();
//test Delete(const Type& )
cout << endl << endl << "Test Delete : " << endl;
tree->Insert(6);
tree->Insert(7);
tree->Insert(9);
tree->Insert(13);
tree->Insert(15);
tree->Insert(4);
tree->Insert(5);
tree->Insert(17);
tree->Insert(19);
tree->Insert(12);
tree->Insert(10);
tree->Insert(14);
tree->Insert(8);
cout << "DLR Output Before Delete: " << endl;
tree->Output_DLR();
tree->Delete(7);
cout << endl << "DLR Output After Delete: " << endl;
tree->Output_DLR();
tree->Clear();
return 0;
}
测试输出：
对于最后的测试Delete的结果，平衡树的改变可以观察下面这副，数据是相同的
http://blog.csdn.net/anialy/article/details/7985165
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- AVL Tree 平衡二叉树基本插入删除节点功能的实现
- 平衡二叉树的 插入 删除 查找 等功能c语言实现 数据结构
- 二叉搜索树的基本功能的实现（递归及非递归直线插入，删除，查找）
- 面试题7：用两个栈实现队列，队列的声明如下，请实现它的两个函数appendTail和deleteHead， 分别完成在队列尾部插入结点和在队列头部删除节点的功能。
- 试用多态实现线性表（队列，串，堆栈），要求具备线性表的基本操作：插入，删除，测长等。
- 平衡二叉树（AVL）--查找、删除、插入（Java实现）
- 地磅称量系统之(53)在封装对象的类库中实现包括IDataErrorInfo接口提供的所有方法和并且扩展对异常具有添加和删除功能的基本业务对象基类
- objective-c 结构体单链表的实现，创建插入删除功能
- 【数据结构】C语言实现链表节点的插入和删除
- c++实现二叉树的查找，插入，删除，深度，叶子节点数，度为1的节点数（递归方法）及运行实例结果
- 一个用Java实现的双向队列，可以分别在头尾插入和删除节点
- C语言实现双向链表删除节点、插入节点、双向输出等操作
- 平衡二叉树（AVL）--查找、删除、插入（Java实现）
- c++实现二叉树的查找，插入，删除，深度，叶子节点数，度为1的节点数（递归方法）及运行实例结果
- 单链表的游标实现：插入、删除、查找、打印等功能
- 单链表基本操作的实现--创建、插入、查找、删除
- 单链表的基本操作的实现（建立、插入、删除、逆序）
- 这是一个关于XML文档的操作管理器XMLHelper类,类中包括XML文档的创建,文档节点和属性的读取,添加,修改,删除的方法功能的实现
- 二叉排序树，完成创建节点，插入节点，删除节点，查找节点,中序遍历的功能
- C语言实现双向链表删除节点、插入节点、双向输出等操作