Anonymous user
Doubly-linked list/Traversal: Difference between revisions
→{{header|ALGOL 68}}
Line 48:
# --- PREPEND - Adds a node to the beginning of the list ---#
PRIO PREPEND = 1;
OP PREPEND = (REF LIST list, DATA data) VOID:
(
HEAP NODE n := (data, NIL, NIL);
IF head OF list IS REF NODE(NIL) THEN
head OF list := tail OF list := n
Line 99:
(
head OF list := tail OF list := NIL
);
| |||