question regarding linked lists.
there is a linked list with 3 nodes, the nodes being 1 , 2 , and 3. 3 is the head node. is it possible to keep a pointer at the tail node, 1, and then insert a node to the back of the tail, making the new node the tail node?
for example, if i wanted to add a 0 to the back of the list, i can then put 0 behind 1. if it's possible, would i have to put 0 in the place of 1 and then shift the rest of the nodes up, or can i create a brand new node and place it right behind 1?