26.1. createList¶

One can easily write a loop to iterate through all the Links on a chain, without needing to know how many there actually are.

1 / 9 Settings

<<<>>>

Let's start again with our original series of Link nodes.

• Link curr = head;
• while (curr.next != null)
• curr = curr.next;

20

30

10

5

head

curr

Saving...
Server Error
Resubmit

26.2. iterateOverList¶

One can remove a Link from a chain.

1 / 4 Settings

<<<>>>

Let's start with our original list again.

• Link q = head.next;
• head.next = q.next;
• q = head.next;

20

30

10

5

head

q

Saving...
Server Error
Resubmit

26.3. changePointeeNext1¶

Finally, we can also insert new Links.

1 / 4 Settings

<<<>>>

Consider we have the following list.

• Link newLink = new Link(8, null);
• newLink.next = head;
• head = newLink;

20

30

10

5

8

head

newLink

Saving...
Server Error
Resubmit

26.4. addNodeAtHead¶