LinkedList vs Array

The head of a linked list points to NULL if the list is not empty.

In a circular linked list, the pointer from the first element in the list points back to the last element.

A singly linked list is represented by a pointer to the last node of the linked list.

In a singly linked list, insertion can only be performed at the beginning of the list.

When inserting a new node into a singly linked list, the next pointer of the new record is set to link it to the item which precedes it in the list.

When deleting a node from a singly linked list, the next pointer of the item immediately following the one to be deleted is altered.

A node can be added in only two ways in a singly linked list.

A circular linked list is a type of doubly linked list.

In a singly linked list, each node has two pointers: one pointing to the next node and one pointing to the previous node.

The LinkedList class in Java contains a reference of Node class type.