Why linked list called self-referencial structure??

Answer 1

I suppose it's because each element of list contains some data, and a reference, often called a pointer, to the next element in the list.

Answer 2

Well all the nodes in the linked list are defined as the objects of the same class from OOP view and from the same structure from procedural programming point of view.In that case as a current node contains the address of the next immediate node,it is evident that it is referencing or addressing an object of the same structure/class and thus you know now why it is called so