Singly Linked List

•A linked list (One-way list) is a linear collection of data elements,

called nodes, where the linear order is given by means of pointers.

•Each node is divided into two parts.

•First part contains the information of the element.

Second part contains the address of the next node in the list.

Linked List

•A singly linked list is a concrete data structure consisting of a

sequence of nodes

•Each node stores

–element

–link to the next node

Key Points

q Linked list

• Linear collection of nodes

• Connected by pointer links

• Accessed via a pointer to the first node of the list

• Link pointer in the last node is set to null to mark the list’s end

•Linked list contains a List Pointer Variable called START or NAME, which contains the address of the first node.

Why Linked List

Arrays: pluses and minuses

+ Fast element access.

-- Impossible to resize

Need of Linked List

•Many applications require resizing!

•Required size not always immediately available.

For the code of singly linked list click here

9to5 Code