Doubly-linked list/Traversal: Difference between revisions
→{{header|Julia}}
Line 843:
node.pred = prevnode
node.succ = succ
if succ != nothing
succ.pred = node
end
node
end
Line 873 ⟶ 876:
insertpost(node1, node2)
insertpost(node2, node3)
print("From beginning to end: "); printconnected(node1)
print("From end to beginning: "); printconnected(node1, fromtail = true)
</lang> {{output}} <pre>
From beginning to end: 1 -> 2 -> 3
From end to beginning: 3 -> 2 -> 1
</pre>
=={{header|Kotlin}}==
|