1. 性质 :
- 可以是空树
- 任意一个节点的左子树和右子树都是平衡二叉树 且高度之差的绝对值 <=1
2.失衡的4种情况
- 在结点的左子树的左子树插入元素,LL 插入;
- 在结点的左子树的右子树插入元素,LR 插入;
- 在结点的右子树的左子树插入元素,RL 插入;
- 在结点的右子树的右子树插入元素,RR 插入;
3.解决方法 代码实现
public class AVLTree {
private AvlNode tree;
public int hight(AvlNode node) {
return node == null ? 0 : node.hight;
}
public int hight() {
return hight(tree);
}
private int getMaxHeight(int height1, int height2) {
return height1 > height2 ? height1 : height2;
}
public void inOrder(AvlNode node){
if(node == null ){
return;
}
inOrder(node.left);
System.out.print(node.getValue()+"->");
inOrder(node.right);
}
public void preOrder(AvlNode node){
if(node == null){
return;
}
System.out.print(node.getValue()+"->");
preOrder(node.left);
preOrder(node.right);
}
public void postOrder(AvlNode node){
if(node == null){
return;
}
postOrder(node.left);
postOrder(node.right);
System.out.print(node.getValue()+"->");
}
private static class AvlNode {
private int value;
private AvlNode left;
private AvlNode right;
private int hight;
public AvlNode(int value, AvlNode left, AvlNode right, int hight) {
this.value = value;
this.left = left;
this.right = right;
this.hight = hight;
}
public AvlNode(int value, AvlNode left, AvlNode right) {
this(value, left, right, 0);
}
public int getValue() {
return value;
}
public void setValue(int value) {
this.value = value;
}
public AvlNode getLeft() {
return left;
}
public void setLeft(AvlNode left) {
this.left = left;
}
public AvlNode getRight() {
return right;
}
public void setRight(AvlNode right) {
this.right = right;
}
public int getHight() {
return hight;
}
public void setHight(int hight) {
this.hight = hight;
}
}
}
3.1**LL : 左左旋转 **
public AvlNode llRotaing(AvlNode node) {
AvlNode avl_lift = node.left;
node.left = avl_lift.right;
avl_lift.right = node;
node.hight = getMaxHeight(hight(node.left), hight(node.right)) + 1;
avl_lift.hight = getMaxHeight(hight(avl_lift.left), hight(avl_lift.right)) + 1;
return avl_lift;
}
3.2RR 右右旋转
public AvlNode rrRotaing(AvlNode node) {
AvlNode avl_right = node.right;
node.right = avl_right.left;
avl_right.left = node;
node.hight = getMaxHeight(hight(node.left), hight(node.right)) + 1;
avl_right.hight = getMaxHeight(hight(avl_right.left), hight(avl_right.right)) + 1;
return avl_right;
}
3.3 LR 左右旋转
public AvlNode lrRotaing(AvlNode node){
node.left = rrRotaing(node.left);
AvlNode avlNode = llRotaing(node);
return avlNode;
}
3.4RL 右左旋转
public AvlNode rlRotaing(AvlNode node){
node.right = llRotaing(node.right);
AvlNode avlNode = rrRotaing(node);
return avlNode;
}
3.5 添加方法
public void insert(int value){
this.tree = insert(tree,value);
}
private AvlNode insert(AvlNode node,int value){
AvlNode p;
if (node == null){
node = createNode(value,0);
}else {
if (value > node.value){
node.right = insert(node.right, value);
if (Math.abs(hight(node.right) - hight(node.left)) > 1) {
p = node;
while (p.right != null){
p = p.right;
}
if (value == p.value) {
node = rrRotaing(node);
} else {
node = rlRotaing(node);
}
}
}else if (value < node.value){
node.left = insert(node.left, value);
if (Math.abs(hight(node.right) - hight(node.left)) > 1) {
p = node;
while (p.left != null){
p = p.left;
}
if (value == p.value) {
node = llRotaing(node);
} else {
node = lrRotaing(node);
}
}
}
}
node.hight = getMaxHeight(hight(node.left), hight(node.right)) + 1;
return node;
}
3.5 断点测试
public static void main(String[] args) {
AVLTree avlTree = new AVLTree();
avlTree.insert(10);
avlTree.insert(8);
avlTree.insert(3);
avlTree.insert(12);
avlTree.insert(9);
avlTree.insert(4);
avlTree.insert(5);
avlTree.insert(7);
avlTree.insert(1);
avlTree.insert(11);
avlTree.insert(17);
}
4.完整代码
public class AVLTree {
public static void main(String[] args) {
AVLTree avlTree = new AVLTree();
avlTree.insert(10);
avlTree.insert(8);
avlTree.insert(3);
avlTree.insert(12);
avlTree.insert(9);
avlTree.insert(4);
avlTree.insert(5);
avlTree.insert(7);
avlTree.insert(1);
avlTree.insert(11);
avlTree.insert(17);
}
private AvlNode tree;
private int i;
public void insert(int value){
this.tree = insert(tree,value);
}
private AvlNode insert(AvlNode node,int value){
AvlNode p;
if (node == null){
node = createNode(value,0);
}else {
if (value > node.value){
node.right = insert(node.right, value);
if (Math.abs(hight(node.right) - hight(node.left)) > 1) {
p = node;
while (p.right != null){
p = p.right;
}
if (value == p.value) {
node = rrRotaing(node);
} else {
node = rlRotaing(node);
}
}
}else if (value < node.value){
node.left = insert(node.left, value);
if (Math.abs(hight(node.right) - hight(node.left)) > 1) {
p = node;
while (p.left != null){
p = p.left;
}
if (value == p.value) {
node = llRotaing(node);
} else {
node = lrRotaing(node);
}
}
}
}
node.hight = getMaxHeight(hight(node.left), hight(node.right)) + 1;
return node;
}
public AvlNode llRotaing(AvlNode node) {
AvlNode avl_lift = node.left;
node.left = avl_lift.right;
avl_lift.right = node;
node.hight = getMaxHeight(hight(node.left), hight(node.right)) + 1;
avl_lift.hight = getMaxHeight(hight(avl_lift.left), hight(avl_lift.right)) + 1;
return avl_lift;
}
public AvlNode rrRotaing(AvlNode node) {
AvlNode avl_right = node.right;
node.right = avl_right.left;
avl_right.left = node;
node.hight = getMaxHeight(hight(node.left), hight(node.right)) + 1;
avl_right.hight = getMaxHeight(hight(avl_right.left), hight(avl_right.right)) + 1;
return avl_right;
}
public AvlNode lrRotaing(AvlNode node) {
node.left = rrRotaing(node.left);
AvlNode avlNode = llRotaing(node);
return avlNode;
}
public AvlNode rlRotaing(AvlNode node) {
node.right = llRotaing(node.right);
AvlNode avlNode = rrRotaing(node);
return avlNode;
}
public int hight(AvlNode node) {
return node == null ? 0 : node.hight;
}
public int hight() {
return hight(tree);
}
private int getMaxHeight(int height1, int height2) {
return height1 > height2 ? height1 : height2;
}
public void inOrder(AvlNode node) {
if (node == null) {
return;
}
inOrder(node.left);
System.out.print(node.getValue() + "->");
inOrder(node.right);
}
public void preOrder(AvlNode node) {
if (node == null) {
return;
}
System.out.print(node.getValue() + "->");
preOrder(node.left);
preOrder(node.right);
}
public void postOrder(AvlNode node) {
if (node == null) {
return;
}
postOrder(node.left);
postOrder(node.right);
System.out.print(node.getValue() + "->");
}
public static AvlNode createNode(int value, AvlNode left, AvlNode right, int hight) {
return new AvlNode(value, left, right, hight);
}
public static AvlNode createNode(int value, int hight) {
return new AvlNode(value, null, null, hight);
}
public static AvlNode createNode(int value, AvlNode left, AvlNode right) {
return new AvlNode(value, left, right);
}
public static AvlNode createNode(int value) {
return new AvlNode(value, null, null);
}
private static class AvlNode {
private int value;
private AvlNode left;
private AvlNode right;
private int hight;
public AvlNode(int value, AvlNode left, AvlNode right, int hight) {
this.value = value;
this.left = left;
this.right = right;
this.hight = hight;
}
public AvlNode(int value, AvlNode left, AvlNode right) {
this(value, left, right, 0);
}
public int getValue() {
return value;
}
public void setValue(int value) {
this.value = value;
}
public AvlNode getLeft() {
return left;
}
public void setLeft(AvlNode left) {
this.left = left;
}
public AvlNode getRight() {
return right;
}
public void setRight(AvlNode right) {
this.right = right;
}
public int getHight() {
return hight;
}
public void setHight(int hight) {
this.hight = hight;
}
}
}