A Reusable Routine for Doubly-Linked Lists, Part 1
January 19, 2011 Miguel Ortiz Martín and Ted Holt
In Implementing Linked Lists in RPG, Ted Holt explained that a linked list consists of a sequence of data records, or nodes, where each node keeps a reference–a pointer–to the next node in the sequence. This sequence might or might not be sorted. Due to the fact that each node points only to the next node in the sequence, this kind of list is also called a singly-linked list. Doubly-linked lists differ from singly-linked lists in that each node of the list keeps pointers to both the previous and the next nodes in the sequence. Whereas a singly-linked list |