Page 298 - Learn to Program - Basic-256

Chapter 19: Stacks, Queues, Lists, and Sorting Page 282

X

Data Data Data

Pointer Head Tail
to the
Head
Illustration 34: Deleting an Item from a Linked List

Inserting a new node is also as simple as creating the new node, linking the
new node to the next node, and linking the previous node to the first node.
Illustration 35 Shows inserting a new node into the second position.

Data Data Data

Pointer Head Tail
to the
Head Data

Illustration 35: Inserting an Item into a Linked List

Linked lists are commonly thought of as the simplest data structures. In the
BASIC language we can't allocate memory like in most languages so we will
simulate this behavior using arrays. In Program 118 we use the data array to
store the text in the list, the nextitem array to contain the index to the next
node, and the freeitem array to contain a stack of free (unused) array
indexes.

© 2019 James M. Reneau (CC BY-NC-SA 3.0 US)