AVL平衡树——Java底层源码

概念：

AVL平衡树是一种最早的自平衡二分搜索树结构；对于任意一个节点，左子树和右子树的高度差不能超过1
（1）满二叉树一定是平衡二叉树，高度最低；
（2）完全二叉树也是平衡二叉树，左右叶子节点深度差小于等于1

代码实现：

【1】定义属性和构造函数以及内部类Node

    private class Node {
        public K key;   //键
        public V value; //值
        public int height;  //高度
        public Node left;
        public Node right;

        public Node (K key, V value) {
            this.key = key;
            this.value = value;
            left = null;
            right = null;
            height = 1; //新结点的高度默认都是1
        }
    }

    private Node root;
    private int size;

    public AVLTreeMap() {
        root = null;
        size = 0;
    }

【2】定义Node getNode(Node node, K key){}、int getHeight(Node node){}方法

• private Node getNode(Node node, K key){}：以node为根的子树中，查找key所在的节点
• private int getHeight(Node node){}获取某一个节点的高度，如果该节点为null，则高度为0

    //以node为根的子树中 查找key所在的结点
    private Node getNode(Node node, K key) {
        if(node == null) {
            return null;
        }
        if (key.compareTo(node.key) < 0) {
            return getNode(node.left, key);
        } else if (key.compareTo(node.key) > 0) {
            return getNode(node.right, key);
        } else {
            return node;
        }
    }

    //获取某一个结点的高度 如果该结点为空 则高度为0
    private int getHeight(Node node) {
        if (node == null) {
            return 0;
        }
        return node.height;
    }

【3】定义int getBalanceFactor(Node node){}、boolean isBST()、void inOrderKeys(Node node, ArrayList list)方法

• private int getBalanceFactor(Node node){}：计算某一个结点的平衡因子（左右子树的高度差）
• public boolean isBST(){}：验证是否是二分搜索树【中序遍历是否有序=》“左小右大”】
• private void inOrderKeys(Node node, ArrayList<K> list){}:实现中序遍历

    //计算某一个结点的平衡因子（左右子树的高度差） >0左边高 ==0左右同高 <0右边高
    private int getBalanceFactor(Node node) {
        if (node == null) {
            return 0;
        }
        return getHeight(node.left) - getHeight(node.right);
    }

    //验证是否是二分搜索树
    public boolean isBST() {
        ArrayList<K> list = new ArrayList<>();
        inOrderKeys(root, list);
        for (int i = 1; i < list.size(); i++) {
            if (list.get(i - 1).compareTo(list.get(i)) > 0) {
                return false;
            }
        }
        return true;
    }

    private void inOrderKeys(Node node, ArrayList<K> list) {
        if (node == null) {
            return;
        }
        inOrderKeys(node.left, list);
        list.add(node.key);
        inOrderKeys(node.right,list);
    }

【4】定义boolean isBalanced()、boolean isBalanced(Node node)、Node leftRotate(Node y)、Node rightRotate(Node y)方法

• public boolean isBalanced(){}：向外界提供的方法，直接调用内部方法boolean isBalanced(Node node)
• private boolean isBalanced(Node node）{}：判断结点是否平衡内部方法，私有化，不需要向外界提供
• private Node leftRotate(Node y){}：左旋转（不平衡结点是在右侧的右侧） 将y结点进行左旋转并返回新的根
• private Node rightRotate(Node y){}：右旋转（不平衡结点是在左侧的左侧） 将y结点进行右旋转并返回新的根

    //验证是否是一颗平衡树
    public boolean isBalanced() {
        return isBalanced(root);
    }

    private boolean isBalanced(Node node) {
        if (node == null) {
            return true;
        }
        int balancedFactor = getBalanceFactor(node);
        if (Math.abs(balancedFactor) > 1) {
            return false;
        }
        return isBalanced(node.left) && isBalanced(node.right);
    }

    //左旋转(右侧的右侧) 将y结点进行左旋转 并返回新的根
    private Node leftRotate(Node y) {
        Node x = y.right;
        Node T3 = x.left;
        x.left = y;
        y.right = 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结点进行右旋转 并返回新的根
    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;
    }

【5】定义void put(K key, V value){}、Node put(Node node, K key, V value){}、V remove(K key){}、Node remove(Node node, K key){}方法

• public void put(K key, V value){}：公开的方法，向外界提供的，内部直接调用私有的方法【因为外界无法创建Node类】
• private Node put(Node node, K key, V value){}:向树中添加一个结点，分为三种情况（所添加结点的值与原来结点值的大小关系【大于、小于、等于】），添加之后还需判断结点是否平衡，若不平衡，进行处理
• public V remove(K key){}：移除值为key的结点
• private Node remove(Node node, K key){}:内部封装的移除方法，同put类似

    @Override
    public void put(K key, V value) {
        root = put(root,key, value);
    }

    private Node put(Node node, K key, V value) {
        if (node == null) {
            size++;
            return new Node(key, value);
        }
        if (key.compareTo(node.key) < 0) {
            node.left = put(node.left, key, value);
        } else if (key.compareTo(node.key) > 0) {
            node.right = put(node.right, key,value);
        } else {
            node.value = value;
        }

        //当前结点的高度需要更新
        node.height = Math.max(getHeight(node.left),getHeight(node.right)) + 1;
        //判断当前结点是否是平衡的
        int balanceFactor = getBalanceFactor(node);

        // >1说明当前结点左侧不平衡 node.left >= 0 左侧的左侧不平衡
        if (balanceFactor > 1 && getBalanceFactor(node.left) >= 0) {
            return rightRotate(node);
        }
        // >1说明当前结点左侧不平衡 node.left < 0 左侧的右侧不平衡
        if (balanceFactor > 1 && getBalanceFactor(node.left) < 0) {
            node.left = leftRotate(node.left);
            return rightRotate(node);
        }
        // <-1说明当前结点右侧不平衡 node.right >= 0 右侧的左侧不平衡
        if (balanceFactor < -1 && getBalanceFactor(node.right) >= 0) {
            node.right = rightRotate(node.right);
            return leftRotate(node);
        }
        // <-1说明当前结点右侧不平衡 node.right < 0 右侧的右侧不平衡
        if (balanceFactor < -1 && getBalanceFactor(node.right) < 0) {
            return leftRotate(node);
        }

        return node;
    }

    @Override
    public V remove(K key) {
        Node delNode = getNode(root,key);
        if (delNode != null) {
            root = remove(root,key);
            return delNode.value;
        }
        return null;
    }

    private Node remove(Node node, K key) {
        if (node == null) {
            return null;
        }
        Node retNode = null;
        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;
                retNode = leftNode;
            } else {
                Node successor = minmum(node.right);
                successor.right = remove(node.right,successor.key);
                successor.left = node.left;
                node.left = node.right = null;
                retNode = successor;
            }
        }
        if (retNode == null) {
            return retNode;
        }
        //更新高度
        retNode.height = Math.max(getHeight(retNode.left), getHeight(retNode.right)) + 1;
        //获取平衡因子判断是否需要自平衡
        int balanceFactor = getBalanceFactor(retNode);

        // >1说明当前结点左侧不平衡 node.left >= 0 左侧的左侧不平衡
        if (balanceFactor > 1 && getBalanceFactor(retNode.left) >= 0) {
            return rightRotate(retNode);
        }
        // >1说明当前结点左侧不平衡 node.left < 0 左侧的右侧不平衡
        if (balanceFactor > 1 && getBalanceFactor(retNode.left) < 0) {
            retNode.left = leftRotate(retNode.left);
            return rightRotate(retNode);
        }
        // <-1说明当前结点右侧不平衡 node.right >= 0 右侧的左侧不平衡
        if (balanceFactor < -1 && getBalanceFactor(retNode.right) >= 0) {
            retNode.right = rightRotate(retNode.right);
            return leftRotate(retNode);
        }
        // <-1说明当前结点右侧不平衡 node.right < 0 右侧的右侧不平衡
        if (balanceFactor < -1 && getBalanceFactor(retNode.right) < 0) {
            return leftRotate(retNode);
        }
        return retNode;
    }

【6】定义获取最小值、是否包含、get、set、获取size、判空方法

• private Node minmum(Node node){}：获取树中最小值，根据"左小右大原则"，树的最左端为最小值
• public boolean contains(K key){}：判断是否包含键为key的结点（遍历即可）
• public V get(K key){}：获取键为key的value
• public void set(K key, V value){}：更新操作
• public int size(){}：获取树中元素个数
• public boolean isEmpty(){}：判断当前树是否为空

private Node minmum(Node node) {
        if (node.left == null) {
            return node;
        } else {
            return minmum(node.left);
        }
    }

    @Override
    public boolean contains(K key) {
        return getNode(root,key) != null;
    }

    @Override
    public V get(K key) {
        Node node = getNode(root,key);
        if (node != null) {
            return node.value;
        }
        return null;
    }

    @Override
    public void set(K key, V value) {
        Node node = getNode(root,key);
        if (node == null) {
            throw new IllegalArgumentException("key-value is not exist");
        }
        node.value = value;
    }

    @Override
    public int size() {
        return size;
    }

    @Override
    public boolean isEmpty() {
        return size == 0 && root == null;
    }

【7】定义获取键的集合、获取值的集合、获取键值对，并实现中序遍历的方法

• public Set<K> keySet() {}:获取键的集合
• private void inOrderKeySet(Node node, TreeSet<K> set){}:中序遍历键的集合
• public List<V> values(){}:获取值的集合
• private void inOrderValues(Node node, LinkedList<V> list){}：中序遍历值的集合
• public Set<Entry<K, V>> entrySet(){}：获取键值对
• private void inOrderEntrys(Node node, TreeSet<Entry<K,V>> entries){}：中序遍历键值对

@Override
    public Set<K> keySet() {
        TreeSet<K> set = new TreeSet<>();
        inOrderKeySet(root, set);
        return set;
    }
    private void inOrderKeySet(Node node, TreeSet<K> set) {
        if (node == null) {
            return;
        }
        inOrderKeySet(node.left,set);
        set.add(node.key);
        inOrderKeySet(node.right,set);
    }

    @Override
    public List<V> values() {
        LinkedList<V> list = new LinkedList<>();
        inOrderValues(root, list);
        return list;
    }
    private void inOrderValues(Node node, LinkedList<V> list) {
        if (node == null) {
            return;
        }
        inOrderValues(node.left, list);
        list.add(node.value);
        inOrderValues(node.right, list);
    }

    @Override
    public Set<Entry<K, V>> entrySet() {
        TreeSet<Entry<K,V>> entries = new TreeSet<>();
        inOrderEntrys(root,entries);
        return entries;
    }
    private void inOrderEntrys(Node node, TreeSet<Entry<K,V>> entries) {
        if (node == null) {
            return;
        }
        inOrderEntrys(node.left, entries);
        entries.add(new BSTEntry<>(node.key, node.value));

        inOrderEntrys(node.right, entries);
    }

【8】定义内部类键值对对象：BSTEntry，实现相关get、比较等方法

//键值对对象
    private class BSTEntry<K extends Comparable<K>,V> implements Entry<K,V> {

        private K key;
        private V value;
        public BSTEntry(K key, V value) {
            this.key = key;
            this.value = value;
        }

        @Override
        public K getKey() {
            return key;
        }

        @Override
        public V getValue() {
            return value;
        }

        @Override
        public String toString() {
            return key + ":" + value;
        }

        @Override
        public int compareTo(Entry<K, V> o) {
            return this.getKey().compareTo(o.getKey()) ;
        }
    }

    //前序遍历
    public void preOrder() {
        preOrder(root);
    }
    //前序遍历-递归方式 以node为根节点 前序遍历DLR
    private void preOrder(Node node) {
        if (node == null) {
            return;
        }
        System.out.println(node.key);
        preOrder(node.left);
        preOrder(node.right);
    }

完整代码：

//AVL平衡二分搜索树实现的映射
public class AVLTreeMap<K extends Comparable<K>,V> implements Map<K,V> {
    private class Node {
        public K key;   //键
        public V value; //值
        public int height;  //高度
        public Node left;
        public Node right;

        public Node (K key, V value) {
            this.key = key;
            this.value = value;
            left = null;
            right = null;
            height = 1; //新结点的高度默认都是1
        }
    }

    private Node root;
    private int size;

    public AVLTreeMap() {
        root = null;
        size = 0;
    }

    //以node为根的子树中 查找key所在的结点
    private Node getNode(Node node, K key) {
        if(node == null) {
            return null;
        }
        if (key.compareTo(node.key) < 0) {
            return getNode(node.left, key);
        } else if (key.compareTo(node.key) > 0) {
            return getNode(node.right, key);
        } else {
            return node;
        }
    }

    //获取某一个结点的高度 如果该结点为空 则高度为0
    private int getHeight(Node node) {
        if (node == null) {
            return 0;
        }
        return node.height;
    }

    //计算某一个结点的平衡因子（左右子树的高度差） >0左边高 ==0左右同高 <0右边高
    private int getBalanceFactor(Node node) {
        if (node == null) {
            return 0;
        }
        return getHeight(node.left) - getHeight(node.right);
    }

    //验证是否是二分搜索树
    public boolean isBST() {
        ArrayList<K> list = new ArrayList<>();
        inOrderKeys(root, list);
        for (int i = 1; i < list.size(); i++) {
            if (list.get(i - 1).compareTo(list.get(i)) > 0) {
                return false;
            }
        }
        return true;
    }

    private void inOrderKeys(Node node, ArrayList<K> list) {
        if (node == null) {
            return;
        }
        inOrderKeys(node.left, list);
        list.add(node.key);
        inOrderKeys(node.right,list);
    }

    //验证得是一颗平衡树
    public boolean isBalanced() {
        return isBalanced(root);
    }

    private boolean isBalanced(Node node) {
        if (node == null) {
            return true;
        }
        int balancedFactor = getBalanceFactor(node);
        if (Math.abs(balancedFactor) > 1) {
            return false;
        }
        return isBalanced(node.left) && isBalanced(node.right);
    }

    //左旋转(右侧的右侧) 将y结点进行左旋转 并返回新的根
    private Node leftRotate(Node y) {
        Node x = y.right;
        Node T3 = x.left;
        x.left = y;
        y.right = 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结点进行右旋转 并返回新的根
    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;
    }

    @Override
    public void put(K key, V value) {
        root = put(root,key, value);
    }

    private Node put(Node node, K key, V value) {
        if (node == null) {
            size++;
            return new Node(key, value);
        }
        if (key.compareTo(node.key) < 0) {
            node.left = put(node.left, key, value);
        } else if (key.compareTo(node.key) > 0) {
            node.right = put(node.right, key,value);
        } else {
            node.value = value;
        }

        //当前结点的高度需要更新
        node.height = Math.max(getHeight(node.left),getHeight(node.right)) + 1;
        //判断当前结点是否是平衡的
        int balanceFactor = getBalanceFactor(node);

        // >1说明当前结点左侧不平衡 node.left >= 0 左侧的左侧不平衡
        if (balanceFactor > 1 && getBalanceFactor(node.left) >= 0) {
            return rightRotate(node);
        }
        // >1说明当前结点左侧不平衡 node.left < 0 左侧的右侧不平衡
        if (balanceFactor > 1 && getBalanceFactor(node.left) < 0) {
            node.left = leftRotate(node.left);
            return rightRotate(node);
        }
        // <-1说明当前结点右侧不平衡 node.right >= 0 右侧的左侧不平衡
        if (balanceFactor < -1 && getBalanceFactor(node.right) >= 0) {
            node.right = rightRotate(node.right);
            return leftRotate(node);
        }
        // <-1说明当前结点右侧不平衡 node.right < 0 右侧的右侧不平衡
        if (balanceFactor < -1 && getBalanceFactor(node.right) < 0) {
            return leftRotate(node);
        }

        return node;
    }

    @Override
    public V remove(K key) {
        Node delNode = getNode(root,key);
        if (delNode != null) {
            root = remove(root,key);
            return delNode.value;
        }
        return null;
    }

    private Node remove(Node node, K key) {
        if (node == null) {
            return null;
        }
        Node retNode = null;
        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;
                retNode = leftNode;
            } else {
                Node successor = minmum(node.right);
                successor.right = remove(node.right,successor.key);
                successor.left = node.left;
                node.left = node.right = null;
                retNode = successor;
            }
        }
        if (retNode == null) {
            return retNode;
        }
        //更新高度
        retNode.height = Math.max(getHeight(retNode.left), getHeight(retNode.right)) + 1;
        //获取平衡因子判断是否需要自平衡
        int balanceFactor = getBalanceFactor(retNode);

        // >1说明当前结点左侧不平衡 node.left >= 0 左侧的左侧不平衡
        if (balanceFactor > 1 && getBalanceFactor(retNode.left) >= 0) {
            return rightRotate(retNode);
        }
        // >1说明当前结点左侧不平衡 node.left < 0 左侧的右侧不平衡
        if (balanceFactor > 1 && getBalanceFactor(retNode.left) < 0) {
            retNode.left = leftRotate(retNode.left);
            return rightRotate(retNode);
        }
        // <-1说明当前结点右侧不平衡 node.right >= 0 右侧的左侧不平衡
        if (balanceFactor < -1 && getBalanceFactor(retNode.right) >= 0) {
            retNode.right = rightRotate(retNode.right);
            return leftRotate(retNode);
        }
        // <-1说明当前结点右侧不平衡 node.right < 0 右侧的右侧不平衡
        if (balanceFactor < -1 && getBalanceFactor(retNode.right) < 0) {
            return leftRotate(retNode);
        }
        return retNode;
    }

    private Node minmum(Node node) {
        if (node.left == null) {
            return node;
        } else {
            return minmum(node.left);
        }
    }

    @Override
    public boolean contains(K key) {
        return getNode(root,key) != null;
    }

    @Override
    public V get(K key) {
        Node node = getNode(root,key);
        if (node != null) {
            return node.value;
        }
        return null;
    }

    @Override
    public void set(K key, V value) {
        Node node = getNode(root,key);
        if (node == null) {
            throw new IllegalArgumentException("key-value is not exist");
        }
        node.value = value;
    }

    @Override
    public int size() {
        return size;
    }

    @Override
    public boolean isEmpty() {
        return size == 0 && root == null;
    }

    @Override
    public Set<K> keySet() {
        TreeSet<K> set = new TreeSet<>();
        inOrderKeySet(root, set);
        return set;
    }
    private void inOrderKeySet(Node node, TreeSet<K> set) {
        if (node == null) {
            return;
        }
        inOrderKeySet(node.left,set);
        set.add(node.key);
        inOrderKeySet(node.right,set);
    }

    @Override
    public List<V> values() {
        LinkedList<V> list = new LinkedList<>();
        inOrderValues(root, list);
        return list;
    }
    private void inOrderValues(Node node, LinkedList<V> list) {
        if (node == null) {
            return;
        }
        inOrderValues(node.left, list);
        list.add(node.value);
        inOrderValues(node.right, list);
    }

    @Override
    public Set<Entry<K, V>> entrySet() {
        TreeSet<Entry<K,V>> entries = new TreeSet<>();
        inOrderEntrys(root,entries);
        return entries;
    }
    private void inOrderEntrys(Node node, TreeSet<Entry<K,V>> entries) {
        if (node == null) {
            return;
        }
        inOrderEntrys(node.left, entries);
        entries.add(new BSTEntry<>(node.key, node.value));

        inOrderEntrys(node.right, entries);
    }
    //键值对对象
    private class BSTEntry<K extends Comparable<K>,V> implements Entry<K,V> {

        private K key;
        private V value;
        public BSTEntry(K key, V value) {
            this.key = key;
            this.value = value;
        }

        @Override
        public K getKey() {
            return key;
        }

        @Override
        public V getValue() {
            return value;
        }

        @Override
        public String toString() {
            return key + ":" + value;
        }

        @Override
        public int compareTo(Entry<K, V> o) {
            return this.getKey().compareTo(o.getKey()) ;
        }
    }

    //前序遍历
    public void preOrder() {
        preOrder(root);
    }
    //前序遍历-递归方式 以node为根节点 前序遍历DLR
    private void preOrder(Node node) {
        if (node == null) {
            return;
        }
        System.out.println(node.key);
        preOrder(node.left);
        preOrder(node.right);
    }
}