Doubly-linked list/Traversal: Difference between revisions
Content added Content deleted
Line 843: | Line 843: | ||
node.pred = prevnode |
node.pred = prevnode |
||
node.succ = succ |
node.succ = succ |
||
if succ != nothing |
|||
succ.pred = node |
|||
end |
|||
node |
node |
||
end |
end |
||
Line 873: | Line 876: | ||
insertpost(node1, node2) |
insertpost(node1, node2) |
||
insertpost(node2, node3) |
insertpost(node2, node3) |
||
println("First value is ", first(node1).value, " and last values is ", last(node1).value) |
|||
print("From beginning to end: "); printconnected(node1) |
print("From beginning to end: "); printconnected(node1) |
||
print("From end to beginning: "); printconnected(node1, fromtail = true) |
print("From end to beginning: "); printconnected(node1, fromtail = true) |
||
</lang> {{output}} <pre> |
</lang> {{output}} <pre> |
||
First value is 1 and last values is 3 |
|||
From beginning to end: 1 -> 2 -> 3 |
From beginning to end: 1 -> 2 -> 3 |
||
From end to beginning: 3 -> 2 -> 1 |
From end to beginning: 3 -> 2 -> 1 |
||
</pre> |
</pre> |
||
=={{header|Kotlin}}== |
=={{header|Kotlin}}== |