前言
AVL树是一种高度平衡的二叉搜索树,即任意节点的左子树和右子树高度之差都不超过1
;
当一棵二叉搜索树进行增加或删除操作时,就有可能产生不平衡的情况。我们要做的就是在出现不平衡的状况时及时进行调整,让整棵树恢复平衡。具体实现方式为左旋转
以及右旋转
,详细请参考AVL树详解
代码实现
基于二分搜索树实现平衡二叉树
package com.sjgd.avltree;
import java.util.ArrayList;
/**
* @author 平衡二叉树
* on 2023/2/16
*/
public class AVLTree<K extends Comparable<K>, V> {
private class Node {
private K key;
private V value;
/**
* 分别对应左右节点
*/
private Node left, right;
/**
* 节点的高度
*/
private int height;
public Node(K key, V value) {
this.key = key;
this.value = value;
this.height = 1;
}
}
private Node root;
private int size;
/**
* 获取节点node对应的高度
*
* @param node
* @return
*/
public int getHeight(Node node) {
if (node == null) {
return 0;
}
return node.height;
}
/**
* 获取节点node对应的平衡因子
*
* @return
*/
public int getBalanceFactor(Node node) {
if (node == null) {
return 0;
}
return getHeight(node.left) - getHeight(node.right);
}
public int getSize() {
return size;
}
public boolean isEmpty() {
return size == 0;
}
// 对节点y进行向右旋转操作,返回旋转后新的根节点x
// y x
// / \ / \
// x T4 向右旋转 (y) z y
// / \ - - - - - - - -> / \ / \
// z T3 T1 T2 T3 T4
// / \
// T1 T2
private Node rightRotate(Node y) {
Node x = y.left;
Node T3 = x.right;
//向右旋转
x.right = y;
y.left = T3;
y.height = Math.max(getHeight(y.left), getHeight(y.right)) + 1;
x.height = Math.max(getHeight(x.left), getHeight(x.right)) + 1;
return x;
}
// 对节点y进行向左旋转操作,返回旋转后新的根节点x
// y x
// / \ / \
// T1 x 向左旋转 (y) y z
// / \ - - - - - - - -> / \ / \
// T2 z T1 T2 T3 T4
// / \
// T3 T4
private Node leftRotate(Node y) {
Node x = y.right;
Node T2 = x.left;
x.left = y;
y.right = T2;
y.height = Math.max(getHeight(y.left), getHeight(y.right)) + 1;
x.height = Math.max(getHeight(x.left), getHeight(x.right)) + 1;
return x;
}
/**
* 向二分搜索树中添加新的元素
*
* @param key
* @param value
*/
public void add(K key, V value) {
root = add(root, key, value);
}
public Node add(Node node, K key, V value) {
if (node == null) {
size++;
return new Node(key, value);
}
if (key.compareTo(node.key) < 0) {
node.left = add(node.left, key, value);
} else if (key.compareTo(node.key) > 0) {
node.right = add(node.right, key, value);
} else {
node.value = value;
}
//更新height
node.height = 1 + Math.max(getHeight(node.left), getHeight(node.right));
//计算平衡因子
int balanceFactor = getBalanceFactor(node);
if (balanceFactor > 1 && getBalanceFactor(node.left) >= 0) {
//说明向左倾斜,需要进行右旋转LL
return rightRotate(node);
}
if (balanceFactor < -1 && getBalanceFactor(node.right) <= 0) {
//说明向右倾斜,需要进行左旋转 RR
return leftRotate(node);
}
if (balanceFactor > 1 && getBalanceFactor(node.left) < 0) {
//说明满足LR条件
node.left = leftRotate(node.left);
return rightRotate(node);
}
if (balanceFactor < -1 && getBalanceFactor(node.left) > 0) {
//说明满足RL条件
node.right = rightRotate(node.right);
return leftRotate(node);
}
return node;
}
/**
* 判断当前二叉树是否是二分搜索树【中序遍历结果是顺序的】
*
* @return
*/
public boolean isBST() {
ArrayList<K> keys = new ArrayList<>();
inOrder(root, keys);
for (int i = 1; i < keys.size(); i++) {
if (keys.get(i - 1).compareTo(keys.get(i)) > 0) {
return false;
}
}
return true;
}
/**
* 对二叉树进行中序遍历
*
* @param node
* @param keys
*/
private void inOrder(Node node, ArrayList<K> keys) {
if (node == null) {
return;
}
inOrder(node.left, keys);
keys.add(node.key);
inOrder(node.right, keys);
}
/**
* 判断该二叉树是否是一颗平衡二叉树
*
* @return
*/
public boolean isBalanced() {
return isBalanced(root);
}
private boolean isBalanced(Node node) {
if (node == null) {
return true;
}
int balanceFactor = getBalanceFactor(node);
if (Math.abs(balanceFactor) > 1) {
return false;
}
return isBalanced(node.left) && isBalanced(node.right);
}
/**
* 返回以node为根节点的二分搜索树中,key所在的节点
*
* @return
*/
public Node getNode(Node node, K key) {
if (node == null) {
return null;
}
if (key.equals(node.key)) {
return node;
} else if (key.compareTo(node.key) < 0) {
return getNode(node.left, key);
} else {
return getNode(node.right, key);
}
}
public boolean contains(K key) {
return getNode(root, key) != null;
}
public V get(K key) {
Node node = getNode(root, key);
if (node == null) {
return null;
}
return node.value;
}
public void set(K key, V newValue) {
Node node = getNode(root, key);
if (node == null) {
throw new IllegalArgumentException("This Key is not exist.");
}
node.value = newValue;
}
/**
* 返回以node为根的二分搜索树的最小值所在的节点
*
* @param node
* @return
*/
private Node minimum(Node node) {
if (node.left == null) {
return node;
}
return minimum(node.left);
}
/**
* 删除掉以node为根的二分搜索树中的最小节点
*
* @param node 返回删除节点后新的二分搜索树的根
* @return
*/
public Node removeMin(Node node) {
if (node.left == null) {
Node rightNode = node.right;
node.right = null;
size--;
return rightNode;
}
node.left = removeMin(node.left);
return node;
}
/**
* 从二分搜索树中删除键为key的节点
*
* @param key
* @return
*/
public V remove(K key) {
Node node = getNode(root, key);
if (node == null) {
return null;
}
root = remove(root, key);
return node.value;
}
private Node remove(Node node, K key) {
if (node == null) {
return null;
}
Node retNode;
if (key.compareTo(node.key) < 0) {
node.left = remove(node.left, key);
retNode = node;
} else if (key.compareTo(node.key) > 0) {
node.right = remove(node.right, key);
retNode = node;
} else {
if (node.left == null) {
Node rightNode = node.right;
node.right = null;
size--;
retNode = rightNode;
} else if (node.right == null) {
Node leftNode = node.left;
node.left = null;
size--;
retNode = leftNode;
} else {
//待删除的节点左右子树都不为空的时候
//找到比待删除节点大的最小节点,即待删除节点的右子树中的最小节点
//使用这个节点顶替待删除的节点的位置
Node successor = minimum(node.right);
//调用removemin方法可能会导致平衡性被打破
successor.right = remove(node.right, successor.key);
successor.left = node.left;
node.left = node.right = null;
retNode = successor;
}
}
if (retNode == null) {
return null;
}
//更新数的高度
retNode.height = 1 + Math.max(getHeight(retNode.left), getHeight(retNode.right));
int balanceFactor = getBalanceFactor(retNode);
if (balanceFactor > 1 && getBalanceFactor(retNode.left) >= 0) {
//LL
return rightRotate(retNode);
}
if (balanceFactor < -1 && getBalanceFactor(retNode.right) <= 0) {
//RR
return leftRotate(retNode);
}
if (balanceFactor > 1 && getBalanceFactor(retNode.left) < 0) {
//LR
retNode.left = leftRotate(retNode.left);
return rightRotate(retNode);
}
if (balanceFactor < -1 && getBalanceFactor(retNode.right) > 0) {
//RL
retNode.right = rightRotate(retNode.right);
return leftRotate(retNode);
}
return retNode;
}
}
基于平衡二叉树实现集合(Set)和映射(Map)
- Set集合
package com.sjgd.avltree;
/**
* @author XiXu
* on 2023/2/17
* @description 基于AVL树实现Set集合
*/
public class AVLSet<E extends Comparable<E>> implements Set<E> {
private AVLTree<E, Object> avlTree;
public AVLSet() {
avlTree = new AVLTree<>();
}
@Override
public void add(E e) {
avlTree.add(e, null);
}
@Override
public void remove(E e) {
avlTree.remove(e);
}
@Override
public boolean contains(E e) {
return avlTree.contains(e);
}
@Override
public int getSize() {
return avlTree.getSize();
}
@Override
public boolean isEmpty() {
return avlTree.isEmpty();
}
}
- Map映射
package com.sjgd.avltree;
/**
* @author XiXu
* on 2023/2/17
* @description 基于AVL树实现Map集合
*/
public class AVLMap<K extends Comparable<K>, V> implements Map<K, V> {
private AVLTree<K, V> avlTree;
public AVLMap() {
avlTree = new AVLTree<>();
}
@Override
public void add(K key, V value) {
avlTree.add(key, value);
}
@Override
public V remove(K key) {
return avlTree.remove(key);
}
@Override
public boolean contains(K key) {
return avlTree.contains(key);
}
@Override
public V get(K key) {
return avlTree.get(key);
}
@Override
public void set(K key, V newValue) {
avlTree.set(key, newValue);
}
@Override
public int getSize() {
return avlTree.getSize();
}
@Override
public boolean isEmpty() {
return avlTree.isEmpty();
}
}
时间复杂度
增加删除操作:O(logn)
结语
如果以上文章对您有一点点帮助,希望您不要吝啬的点个赞加个关注,您每一次小小的举动都是我坚持写作的不懈动力!ღ( ´・ᴗ・` )