Here's the pseudocode for linked nodes:
struct Node data: int next: Node* function addNode(head, tail, value)
newNode := new Node(value, nullptr)
if head == nullptr then
head := newNode
tail := newNode
else
tail.next := newNode
tail := newNode function printList(head)
current := head
while current != nullptr do
print current.data current := current.next function freeList(head)
while head != nullptr do
temp := head
head := head.next delete temp
``` In C++, use the arrow operator (->) to access members through pointers: current->data instead of current.data.