skiplistnode.java

来自「JAVA实现的数据结构」· Java 代码 · 共 14 行

/*************************  SkipListNode.java  *********************/

public class SkipListNode<T> {
    public T key;
    public SkipListNode<T>[] next;
    SkipListNode(T i, int n) {
        key = i;
        next = new SkipListNode[n];
        for (int j = 0; j < n; j++)
            next[j] = null;
    }
}