Visualize different Singly Linked List operations in action.
HEAD
NULL
List is empty
|Create first node
Operation
Also referred to as push(), this operation inserts a new node at the end of the Linked List. Usually takes O(n) time, but since we have a separate pointer for the tail, it executes in just O(1) time.