The simplest kind of linked list is a singly-linked list, which has one link per node. This link points to the next node in the list, or to a null value or empty list if it is the final node.


A singly-linked list containing two values: the value of the current node and a link to the next node

A singly linked list's node is divided into two parts. The first part holds or points to information about the node, and second part holds the address of next node. A singly linked list travels one way.

Thanks
New SQL SERVER Interview Question & Answers