Doubly-linked list/Definition: Difference between revisions
m
→{{header|Julia}}
Line 1,437:
node.pred = prevnode
node.succ = succ
if succ != nothing
succ.pred = node
end
node
end
function insertpre(postnode, node)
Line 1,446 ⟶ 1,448:
node.succ = postnode
node.pred = pred
if pred != nothing
pred.succ = node
end
node
end
Line 1,454 ⟶ 1,459:
succ = nd.succ
if pred != nothing pred.succ = succ end
if succ != nothing succ.
end
nothing
Line 1,484 ⟶ 1,489:
node2 = DLNode(2)
node3 = DLNode(3)
node4 = DLNode(4)
insertpost(node1, node2)
insertpre(node2, node4)
insertpost(node2, node3)
println("First value is ", first(node1).value, " and last
print("From beginning to end: "); printconnected(node1)
delete(node4)
print("From end to beginning post deletion: "); printconnected(node1, fromtail = true)
</lang> {{output}} <pre>
First value is 1 and last
From beginning to end: 1 -> 4 -> 2 -> 3
From end to beginning post deletion: 3 -> 2 -> 1
</pre>
| |||