The type of linked list in which the node does not contain any pointer or reference to the previous node:
Answer: B
A singly linked list is one in which each node has two fields, namely data field and pointer field. Data field stores the data and the pointer field points to the address of the next node.