3.6. Link Nodes — CSCD 320 Algorithms (Java)

3.6.1. Link Nodes¶

In this module, we introduce the idea of a link node. A link node has some sort of value field, and a pointer to another link node. Later, you will learn about linked lists, which are made from link nodes. For now, we will just use them as a simple way to connect some objects together.

Here is a class definition for a basic link object. Note that, while the next field references another link object, the data field is of type Object. This denotes that we don't really care what sort of thing one stores in a link node's data field.

class Link {
  public Link next; //Point to next node in list
  public Object data; //Value for this node

  //Constructors
  public Link(Object data, Link next) {
    this.data = data;
    this.next = next;
  }

  public Link(Object data) {
    this.data = null;
    this.next = next;
  }

  Object getData() { // Return the data field
    return data;
  }

  void setData(Object newData) { // Set the data field
    data = newData;
  }

  Link getNext() { // Return the next field
    return next;
  }

  void setNext(Link newNext) { // Set the next field
    next = newNext;
  }
}