The previous node in a linked list???

Are you able to access the previous node in a linked list? Like to traverse to the next node in a linked list it would just be

list.node(x).next

but what about the previous node? I assumed it to be something like this:

list.node(x).prev

But unfortunately that's not right....

Answer 1

[Ryan Livingston]

That would depend on whether your list implementation is singly or doubly linked. In the latter case, nodes have info about the previous and next nodes however for singly they only know about the next node.

What kind of thing is list.node(x)? If it is an MCOS object then you can have a look at its methods and properties with:

 methods(list.node(x))
 properties(list.node(x))

and see if something is available for you.

[Walter Roberson]

If the list is singly linked and you need to find the previous node anyhow, then you need to start at the beginning and keep iterating over the links until you find the node whose "next" field indicates the node you are trying to find the previous of.