This is the pseudocode of a doubly linked list (inserting a node) from wikipedia which i'm learning. Can anyone help me with the second last line "node.next.prev :=newNode, I'm failing to...

Question

1.00/5 (1 vote)

See more:

function insertAfter(List list, Node node, Node newNode)
     newNode.prev  := node
     newNode.next  := node.next
     if node.next == null
         list.lastNode  := newNode
     else
         node.next.prev  := newNode
     node.next  := newNode

Posted 17-Aug-14 23:16pm

Member 10943543

Updated 17-Aug-14 23:18pm

v2

Add a Solution

Comments

enhzflep 18-Aug-14 5:40am

Your question is currently useless. Consider editing the title to something reasonable (e.g Doubly Linked List implementation) also, remember to add your question to the body of the question. As it stands, the unreasonable title is no big deal. However, the omission of (1/2 of) the question makes this impossible to answer without further input from yourself.

1 solution

Add a Solution

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

OriginalGriff · Accepted Answer · 2014-08-18T01:28:00

OK...think about what a doubly linked list needs to have:

Node      1      2      3
Prev      0    <-1    <-2
Next      2->    3->    0

So when you try to insert a new node between 1 and 2, you have to affect 1's Next node, and 2's previous:

Node      1      x      2      3
Prev      0    <-1    <-x    <-2
Next      x->    2->    3->    0

So:

node.next.prev:=newNode

Is inserting the "x" reference in the "prev" link of the next node: the "x" in the "Prev" of "2" in my example.

Try it with pen and paper: it'll make sense!

This is the pseudocode of a doubly linked list (inserting a node) from wikipedia which i'm learning. Can anyone help me with the second last line "node.next.prev :=newNode, I'm failing to...

1 solution

Solution 1

Add your solution here

Preview 0

This is the pseudocode of a doubly linked list (inserting a node) from wikipedia which i'm learning. Can anyone help me with the second last line "node.next.prev :=newNode, I'm failing to...

1 solution

Solution 1

Add your solution here

Preview 0

Existing Members

...or Join us