Linked Lists Pseudocode

1procedure TRAVERSE(head)
2  current ← head
3  while current ≠ NULL do
4    visit current.data
5    current ← current.next
6  end while
7end procedure

1procedure INSERT_HEAD(head, value)
2  node ← new Node(value)
3  node.next ← head
4  head ← node
5  return head
6end procedure

1procedure INSERT_AFTER(node, value)
2  if node = NULL then return
3  newNode ← new Node(value)
4  newNode.next ← node.next
5  node.next ← newNode
6end procedure

1procedure DELETE_VALUE(head, value)
2  if head = NULL then return head
3  if head.data = value then
4    head ← head.next
5    return head
6  end if
7  prev ← head
8  current ← head.next
9  while current ≠ NULL do
10    if current.data = value then
11      prev.next ← current.next
12      break
13    end if
14    prev ← current
15    current ← current.next
16  end while
17  return head
18end procedure

1Algorithm InsertBeforeNode(head, targetValue, newData):
2    newNode ← CreateNode(newData)
3    if head != NULL AND head.data == targetValue:
4        newNode.next ← head
5        head ← newNode
6        return head
7    current ← head
8    while current != NULL AND current.next != NULL AND current.next.data != targetValue:
9        current ← current.next
10    if current == NULL OR current.next == NULL:
11        PRINT "Target node not found"
12        return head
13    newNode.next ← current.next
14    current.next ← newNode
15    return head

1procedure REVERSE(head)
2  prev ← NULL
3  current ← head
4  while current ≠ NULL do
5    next ← current.next
6    current.next ← prev
7    prev ← current
8    current ← next
9  end while
10  head ← prev
11  return head
12end procedure