java中的链表和树的节点

最新推荐文章于 2022-08-11 21:54:59 发布

原创最新推荐文章于 2022-08-11 21:54:59 发布 · 991 阅读

0 ·

CC 4.0 BY-SA版权

java基础同时被 2 个专栏收录

5 篇文章

订阅专栏

数据结构与算法

1 篇文章

订阅专栏

本文详细介绍了Java集合框架中LinkedList和TreeMap的数据结构实现原理。对于LinkedList，其内部通过Entry类节点来维护双向链表结构，每个节点包含前驱和后继指针。而TreeMap则使用Entry类实现红黑树结构，每个节点包含键值对、左右子节点及父节点等信息。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

LinkedList中的Entry作为链表中的节点，是含有上一个节点和下一个节点的指针；

private static class Entry<E> {

       E element;
       Entry<E> next;
       Entry<E> previous;

       Entry(E element, Entry<E> next, Entry<E> previous) {
           this.element = element;
           this.next = next;
           this.previous = previous;
       }

}

TreeMap中的树节点

/**
     * Node in the Tree. Doubles as a means to pass key-value pairs back to
     * user (see Map.Entry).
     */

    static final class Entry<K,V> implements Map.Entry<K,V> {
   K key;
        V value;
        Entry<K,V> left = null;
        Entry<K,V> right = null;
        Entry<K,V> parent;
        boolean color = BLACK;

        /**
         * Make a new cell with given key, value, and parent, and with
         * <tt>null</tt> child links, and BLACK color.
         */
        Entry(K key, V value, Entry<K,V> parent) {
            this.key = key;
            this.value = value;
            this.parent = parent;
        }

        /**
         * Returns the key.
         *
         * @return the key
         */
        public K getKey() {
            return key;
        }

        /**
         * Returns the value associated with the key.
         *
         * @return the value associated with the key
         */
        public V getValue() {
            return value;
        }

        /**
         * Replaces the value currently associated with the key with the given
         * value.
         *
         * @return the value associated with the key before this method was
         *         called
         */
        public V setValue(V value) {
            V oldValue = this.value;
            this.value = value;
            return oldValue;
        }

        public boolean equals(Object o) {
            if (!(o instanceof Map.Entry))
                return false;
            Map.Entry<?,?> e = (Map.Entry<?,?>)o;

            return valEquals(key,e.getKey()) && valEquals(value,e.getValue());
        }

        public int hashCode() {
            int keyHash = (key==null ? 0 : key.hashCode());
            int valueHash = (value==null ? 0 : value.hashCode());
            return keyHash ^ valueHash;
        }

        public String toString() {
            return key + "=" + value;
        }
    }