1procedure insertHead(value)
2 node ← new Node(value)
3 node.next ← head
4 head ← node
5procedure insertTail(value)
6 traverse to last node
7 last.next ← new Node(value)
8procedure delete(value)
9 find node with value
10 prev.next ← node.next
11procedure search(value)
12 traverse until value found