Modify a data structure : Using Add To Head

The video tutorial explains how to create and manipulate a linked list by adding nodes to the head. It starts with creating a linked list and adding the first node, which becomes both the head and tail. The tutorial then adds a second node, explaining how pointers work in a linked list. It discusses circular references between nodes and adds a third node to demonstrate the linked list structure. The video concludes by verifying the list's structure and introduces the next method, 'add to tail', to be covered in the following video.

What does it mean when the text mentions circular references between nodes?

How does the linked list structure change when a new node with a value of 300 is added?

What is the significance of the tail node's previous property in the context of the linked list?