Modify a data structure : Add To Tail

The video tutorial explains the 'add to tail' method for a linked list, which is the reverse of the 'add to head' method. It covers creating a new node, handling cases where the linked list is empty, and setting the head and tail pointers appropriately. The tutorial concludes with testing the method to ensure it functions correctly.

What happens to the head pointer when the linked list is empty and a new node is added?

Explain the final step of the 'add to tail' method after all configurations are done.