AVL树

 AVL树是普通二叉查找树的变形，查找效率会比红黑树好，但是由于要求更严格，所以插入和删除比红黑树消耗大。

定义：

1>它的左子树和右子树都是AVL树
2>左子树和右子树的高度差不能超过1
从条件1可能看出是个递归定义,如GNU一样.

性质：

1>一棵n个结点的AVL树的其高度保持在0(log2(n)),不会超过3/2log2(n+1)
2>一棵n个结点的AVL树的平均搜索长度保持在0(log2(n)).
3>一棵n个结点的AVL树删除一个结点做平衡化旋转所需要的时间为0(log2(n)).

性能：实际效率和插入节点的分布有关系。

AVL trees are actually easier to implement than RB trees because there are fewer cases. And AVL trees require O(1) rotations on an insertion, whereas red-black trees require O(lg n).
In practice, the speed of AVL trees versus red-black trees will depend on the data that you're inserting. If your data is well distributed, so that an unbalanced binary tree would generally be acceptable (i.e. roughly in random order), but you want to handle bad cases anyway, then red-black trees will be faster because they do less unnecessary rebalancing of already acceptable data.On the other hand, if a pathological insertion order (e.g. increasing order of key) is common, then AVL trees will be faster, because the stricter balancing rule will reduce the tree's height.
Splay trees might be even faster than either RB or AVL trees,depending on your data access distribution. And if you can use a hash instead of a tree, then that'll be fastest of all.

实现特点：

a）包括插入的递归和非递归操作，删除的递归和非递归操作。
b）递归函数主要是在递归语句后面加上旋转语句，但要注意真正插入和删除语句并不要旋转操作。

c）非递归插入删除操作是在普通BST操作的基础上加上平衡“上滤”操作完成的，和堆的“上滤”操作思想差不多。从不平衡点开始执行旋转操作一直到“根”或者在“上滤”路径中某个节点符合条件。当然在判断是否要执行旋转之前要更新其高度!!

d）在AVLNode中加入一个parent域后非递归操作比递归似乎更简单，当然递归操作中的对parent操作并不需要，只是为了和非递归操作兼容而强行加入的。

--------------------------------------------------------------------------------------------------------------------------------------

 

 

 package cai.tree; import java.io.*; import java.util.*; class AVLTree<E extends Comparable>{ class AVLNode<E>{ public E data; public AVLNode<E> parent; public AVLNode<E> left; public AVLNode<E> right; private int height; public AVLNode(E data, AVLNode<E> p, AVLNode<E> l, AVLNode<E> r){ this.data = data; parent = p; left = l; right = r; height = 0; } public AVLNode(E data, AVLNode<E> l, AVLNode<E> r){ this.data = data; left = l; right = r; height = 0; parent = null; } } public AVLNode<E> root; private int size; private int height(AVLNode<E> t){ return t == null ? -1 : t.height; } public AVLTree(){ size = 0; root = null; } public void makeEmpty(){ root = null; } public boolean isEmpty(){ return root == null; } public boolean contains(E element){ return containsRec(element, root); } public int size(){ return size; } public AVLNode<E> findMin(AVLNode<E> node){ if(node == null){ return null; } while(node.left != null){ node = node.left; } return node; } public AVLNode<E> findMax(AVLNode<E> node){ if(node == null){ return null; } while(node.right != null){ node = node.right; } return node; } private boolean containsRec(E element , AVLNode<E> p){ if(p == null){ return false; } int t = element.compareTo(p.data); if(t > 0){ return containsRec(element , p.right); } else if(t < 0){ return containsRec(element , p.left); } else{ return true; } } public void insertRec(E element){ size++; root = insertRec(element , root, null); } private AVLNode<E> rotateLeft(AVLNode<E> p){ //旋转操作中将所有有关parent都设置好（包括旋转后的子树根） System.out.println("left " + p.data); AVLNode<E> k = p.right; k.parent = p.parent; //important !!!!! if(p.parent == null){ root = k; } else if(p.parent.right == p){ p.parent.right = k; } else p.parent.left = k; p.right = k.left; if(k.left != null)k.left.parent = p; k.left = p; p.parent = k; p.height = (height(p.left) > height(p.right) ? height(p.left) : height(p.right)) + 1; k.height = (p.height > height(p.right) ? p.height : height(p.right)) + 1; return k; } private AVLNode<E> rotateRight(AVLNode<E> p){ //旋转操作中将所有有关parent都设置好（包括旋转后的此子树的根） System.out.println("right " + p.data); AVLNode<E> k = p.left; k.parent = p.parent; //important !!!! if(p.parent == null){ root = k; } else if(p.parent.right == p){ p.parent.right = k; } else p.parent.left = k; p.left = k.right; if(k.right != null)k.right.parent = p; k.right = p; p.parent = k; p.height = (height(p.left) > height(p.right) ? height(p.left) : height(p.right)) + 1; k.height = (p.height > height(p.right) ? p.height : height(p.right)) + 1; return k; } private AVLNode<E> insertRec(E element, AVLNode<E> p, AVLNode<E> pre){ if(p == null){ return new AVLNode<E>(element, pre, null, null); } int re = element.compareTo(p.data); if(re > 0){ p.right = insertRec(element, p.right, p); if(height(p.left) - height(p.right) == -2){ if(element.compareTo(p.right.data) > 0){ p = rotateLeft(p); }else{ p.right = rotateRight(p.right); p = rotateLeft(p); } } } else if(re < 0){ p.left = insertRec(element, p.left, p); if(height(p.left) - height(p.right) == 2){ if(element.compareTo(p.left.data) < 0){ p = rotateRight(p); }else{ p.left = rotateLeft(p.left); p = rotateRight(p); } } } else{ size--; } p.height = (height(p.left) > height(p.right) ? height(p.left) : height(p.right)) + 1; return p; } public void removeRec(E element){ size--; removeRec(element, root); } private AVLNode<E> removeRec(E element, AVLNode<E> t){ if(t == null){ size++; System.out.println("could not find the element"); return null; } int re = element.compareTo(t.data); if(re > 0){ t.right = removeRec(element, t.right); if(height(t.left) - height(t.right) == 2){ AVLNode<E> p = t.left; if(height(p.left) >= height(p.right)){ //等高单旋转即可，否则可能在子树中导致不平衡 t = rotateRight(t); }else{ t.left = rotateLeft(t.left); t = rotateRight(t); } } } else if(re < 0){ t.left = removeRec(element, t.left); if(height(t.right) - height(t.left) == 2){ AVLNode<E> p = t.right; if(height(p.right) >= height(p.left)){ //等高单旋转即可，否则可能在子树中导致不平衡。 t = rotateLeft(t); }else{ t.right = rotateRight(t.right); t = rotateLeft(t); } } } else{ if(t.left != null && t.right != null){ t.data = findMin(t.right).data; t.right = removeRec(t.data, t.right); if(height(t.left) - height(t.right) == 2){ AVLNode<E> p = t.left; if(height(p.left) >= height(p.right)){ //等高的时候单旋转即可，否则可能在子树中导致不平衡。 t = rotateRight(t); }else{ t.left = rotateLeft(t.left); t = rotateRight(t); } } }else{ AVLNode<E> tempPare = t.parent; t = t.left == null ? t.right : t.left; if(t != null) t.parent = tempPare; //修改父节点域 // return t; } } if(t != null) t.height = (height(t.left) > height(t.right) ? height(t.left) : height(t.right)) + 1; //×× return t; } public void insert(E element){ size++; if(root == null){ root = new AVLNode(element, null, null, null); return ; } AVLNode<E> p = root; AVLNode<E> pare = null; int re = 0; while(p != null){ pare = p; //插入可以直接这样做。因为正常情况下（该元素在树中不存在），p最后等于null，则pare记录了其父节点。 re = element.compareTo(p.data); if(re > 0){ p = p.right; } else if(re < 0){ p = p.left; } else{ size--; System.out.println("the element exists in the tree"); return ; } } AVLNode<E> newNode = new AVLNode<E>(element, pare, null, null); if(re > 0){ pare.right = newNode; //pare != null }else{ pare.left = newNode; } AVLNode<E> currentNode = newNode.parent; //其实父节点是平衡的 while(currentNode != null){ currentNode.height = (height(currentNode.left) > height(currentNode.right) ? height(currentNode.left) : height(currentNode.right)) + 1; AVLNode<E> last = currentNode.parent; if(height(currentNode.left) - height(currentNode.right) == 2){ if(height(currentNode.left.left) > height(currentNode.left.right)){ rotateRight(currentNode); //如果需要旋转（进入了第一层if），则“不会”发生插入后子树的子树等高的情况。 }else{ //即不存在height(currentNode.left.left) == height(currentNode.left.right)的情况，否则在没插入前就是不平衡的了。 rotateLeft(currentNode.left); rotateRight(currentNode); } } else if(height(currentNode.left) - height(currentNode.right) == -2){ if(height(currentNode.right.right) > height(currentNode.right.left)){ rotateLeft(currentNode); }else{ rotateRight(currentNode.right); rotateLeft(currentNode); } } else if(height(currentNode.left) - height(currentNode.right) == 0){ break; //插入了后两边高度相同，则总高度还是不变，直接break. } currentNode = last; } return ; } public void remove(E element){ AVLNode<E> p = root; if(p == null){ System.out.println("it's a empty tree"); return ; } size--; AVLNode<E> pre = null; while(p != null){ int re = element.compareTo(p.data); if(re > 0){ p = p.right; } else if(re < 0){ p = p.left; } else{ break; } } if(p == null){ size++; System.out.println("could not find the element in the tree"); return ; } pre = p.parent; //pre直接置为p的父节点 if(p.left != null && p.right != null){ AVLNode<E> tempNode = p.right; AVLNode<E> tempPre = p; while(tempNode.left != null){ //tempPre = tempNode; //其实有父节点域后不用tempPre = tempNode,直接在循环过后取tempNode节点的父节点 tempNode = tempNode.left; } tempPre = tempNode.parent; p.data = tempNode.data; if(tempNode == p.right){ if(p.right.right != null){ //修改父节点域 p.right.right.parent = p; } p.right = p.right.right; }else{ if(tempNode.right != null){ //修改父节点域 tempNode.right.parent = tempPre; } tempPre.left = tempNode.right; } pre = tempPre; //pre置为实际删除点的父节点 // pre.height = ( height(pre.left) > height(pre.right) ? height(pre.left) : height(pre.right) ) + 1;//暂时不更新高度 }else{ AVLNode<E> temp = (p.left == null) ? p.right : p.left; if(pre != null){ if(pre.data.compareTo(p.data) > 0){ if(temp != null){ //修改父节点域 temp.parent = pre; } pre.left = temp; } else if(pre.data.compareTo(p.data) < 0){ if(temp != null){ temp.parent = pre; } pre.right = temp; } else{ pre = temp; //不可能达到！！ } // pre.height = ( height(pre.left) > height(pre.right) ? height(pre.left) : height(pre.right) ) + 1;//暂时不更新高度 }else{ root = temp; //root.height = ( height(root.left) > height(root.right) ? height(root.left) : height(root.right) ) + 1; return; //删除的为root节点，由于root的子树至少一个是null，将root置为temp，然后返回即可。 } } AVLNode<E> currentNode = pre; while(currentNode != null){ AVLNode<E> last = currentNode.parent; int preHeight = currentNode.height; currentNode.height = (height(currentNode.left) > height(currentNode.right) ? height(currentNode.left) : height(currentNode.right)) + 1; if(height(currentNode.left) - height(currentNode.right) == 2){ if(height(currentNode.left.left) >= height(currentNode.left.right)){ //注意“=”，如果右子树的两棵子树等高则不需要对右子树旋转。否则可能出错 rotateRight(currentNode); //即等高的情况下，单旋转即可。 }else{ rotateLeft(currentNode.left); rotateRight(currentNode); } } else if(height(currentNode.left) - height(currentNode.right) == -2){ if(height(currentNode.right.right) >= height(currentNode.right.left)){ //注意“=”：如果右子树的两棵子树等高则不需要对右子树旋转。否则可能出错 rotateLeft(currentNode); //即等高的情况下，单旋转即可。 }else{ rotateRight(currentNode.right); rotateLeft(currentNode); } } /*else if(height(currentNode.left) - height(currentNode.right) == 1){ //平衡 if(preHeight == currentNode.height){ //高度不变 break; //删除前后高度不变则删除点必不是关键路径上的点（或者删除前两子树等高），并且如果树也平衡则可以直接break。 } //由于删除后还平衡则只可能是原来两棵子树高度相等。 } else if(height(currentNode.left) - height(currentNode.right) == -1){ //平衡 if(preHeight == currentNode.height){ //高度不变 break; //只可能是原来两棵子树高度相等。 } } else if(height(currentNode.left) - height(currentNode.right) == 0){ // break; //删除后两边相同，高度必然发生变化了（减一），不能break。 } */ else if(preHeight == currentNode.height){ break; } currentNode = last; } } public void printTree(){ Stack<AVLNode<E>> theStack = new Stack<AVLNode<E>>(); theStack.push(root); System.out.println("the height of root :" + height(root.left) + " " + height(root.right)); while(!theStack.empty()){ AVLNode<E> theNode = theStack.pop(); System.out.println(theNode.data); if(theNode.right != null){ theStack.push(theNode.right); } if(theNode.left != null){ theStack.push(theNode.left); } } } } class AVLTest{ public static void main(String[] args){ /*AVLTree<String> theAVL = new AVLTree<String>(); theAVL.insertRec("aa"); theAVL.insertRec("bb"); theAVL.insertRec("cc"); System.out.println("--------------------------------------------------"); theAVL.printTree(); theAVL.insertRec("dd"); System.out.println("--------------------------------------------------"); theAVL.printTree(); theAVL.insertRec("ee"); System.out.println("--------------------------------------------------"); theAVL.printTree(); theAVL.insertRec("ff"); theAVL.insertRec("gg"); System.out.println("--------------------------------------------------"); theAVL.printTree(); theAVL.insertRec("hh"); System.out.println("--------------------------------------------------"); theAVL.printTree(); theAVL.insertRec("kk"); System.out.println(theAVL.size()); System.out.println("--------------------------------------------------"); theAVL.printTree(); theAVL.removeRec("zz"); theAVL.removeRec("ss"); theAVL.removeRec("ff"); theAVL.removeRec("bb"); theAVL.printTree(); System.out.println("--------------------------------------------------"); System.out.println(theAVL.size()); theAVL.insertRec("zz"); System.out.println(theAVL.size()); System.out.println("--------------------------------------------------"); System.out.println(theAVL.findMin(theAVL.root).data); System.out.println(theAVL.findMax(theAVL.root).data); System.out.println(theAVL.root.data + " " + theAVL.root.parent); System.out.println("--------------------------------------------------"); theAVL.printTree(); */ AVLTree<String> theAVL = new AVLTree<String>(); theAVL.insert("aa"); theAVL.insert("bb"); theAVL.insert("cc"); System.out.println("--------------------------------------------------"); theAVL.printTree(); theAVL.insert("dd"); System.out.println("--------------------------------------------------"); theAVL.printTree(); theAVL.insert("ee"); System.out.println("--------------------------------------------------"); theAVL.printTree(); theAVL.insert("ff"); theAVL.remove("ff"); theAVL.remove("ee"); theAVL.insert("gg"); System.out.println("--------------------------------------------------"); theAVL.printTree(); theAVL.insert("hh"); System.out.println("--------------------------------------------------"); theAVL.printTree(); theAVL.insert("kk"); System.out.println(theAVL.size()); System.out.println("--------------------------------------------------"); theAVL.printTree(); theAVL.remove("zz"); theAVL.remove("ss"); theAVL.remove("ff"); theAVL.printTree(); System.out.println("----@@@@@@@@@@---------------------"); theAVL.remove("bb"); theAVL.printTree(); System.out.println("-----@@@@@@@@@@@@@@@-------------------------"); theAVL.remove("aa"); theAVL.printTree(); System.out.println("----@@@@@@@@@@@@@@@------------------------"); theAVL.remove("cc"); theAVL.printTree(); System.out.println("---@@@@@@@@@@@@@@2-----------------------"); theAVL.remove("dd"); theAVL.printTree(); System.out.println("---@@@@@@@@@@@@-----------------------------"); System.out.println(theAVL.size()); theAVL.insert("zz"); System.out.println(theAVL.size()); System.out.println("--------------------------------------------------"); System.out.println(theAVL.findMin(theAVL.root).data); System.out.println(theAVL.findMax(theAVL.root).data); System.out.println(theAVL.root.data + " " + theAVL.root.parent); System.out.println("--------------------------------------------------"); theAVL.printTree(); } }