single linked list with head and tail pointers
I am trying to understand how the single linked list will design if we are using head and tail pointers in list. First node would be "head" of list and last node be "tail" of list.
In a case where no elements in list so head and tail should be NULL pointer.
What happens in case when first node created ?
Does the head pointer point to the first node of list ? I think yes
Does the tail pointer point to the first node of list ? I think yes
Does the first node point to the next node of list ? I think yes