Data structures and algorithms in Java, Part 4: Singly linked lists

Like arrays, which were introduced in Part 3 of this tutorial series, linked lists are a fundamental data structure category upon which more complex data structures can be based. Unlike a sequence of elements, however, a linked list is a sequence of nodes, where each node is linked to the previous and next node in the sequence. Recall that a node is an object created from a self-referential class, and a self-referential class has at least one field whose reference type is the class name. Nodes in a linked list are linked via a node reference. Here’s an example:

To read this article in full, please click here