Question

Why linked list is called self referential data type?

Answer 1

Hy.....

The simplest type of self-referential list structure is a sequence of elements. Each element contains some data, and a reference, often called a pointer, to the next element in the list. ... The field data stores the datamember for this element. Thereference variable next is called alink .