// Source code example for "A Practical Introduction
// to Data Structures and Algorithm Analysis"
// by Clifford A. Shaffer, Prentice Hall, 1998.
// Copyright 1998 by Clifford A. Shaffer

public class SkipNode { // Skiplist node class
  private Object value;   // Data value for the node
  public SkipNode[] forward; // The node's pointer array
  // forward really should not be public.
  // It gets manipulated (only) by the SkipList class

  public Object value() { return value; }

  public SkipNode(Object r, int level) { // Constructor
    value = r;
    forward = new SkipNode[level+1];
    for (int i=0; i<level; i++)
      forward[i] = null;
  }
}