This removes a node from the linked list
by removing the node in question from chain,
so to speak. Basically, while iterating threw
the list it keeps track of the previous node
then when it finds the node it assigns
node.next to prev.next, affectively skipping
the found node.

This method modifies the linked list
to be unique with the help of a buffer.
Nodes are added to element_list and it
is checked each iteration to see if the
current node already exists in it. If it
does, it set the previous node’s next link
to equal the current node’s next (removing
it from the linked list.