Anonymous user
Doubly-linked list/Definition: Difference between revisions
m
→{{header|M2000 Interpreter}}
Line 1,524:
Group Head, Tail
Module PushTail(k as pointer) {
}▼
}
}
Function RemoveTail {
▲ }
=n▼
}
Module PushHead(k as pointer) {
if .head is Null then {
Line 1,646:
L.InsertAfter m1, newNode
L.RemoveNode m1
clear m1 ' last time
newNode=Null
Print "ok.............."
|