The list implementation changed a bit. Now we begin with to nodes: first and last and they will always exist in the list; insertions can be made AFTER first and BEFORE last.
The list implementation changed a bit. Now we begin with to nodes: first and last and they will always exist in the list; insertions can be made AFTER first and BEFORE last.

hstefan/htlib,hstefan/htlib,hstefan/htlib,hstefan/htlib