[Java] Linked List - Introduction - Data Structures

Linked List - Introduction

A Linked List is a concrete data structure consisting of a sequence of nodes, each containing arbitrary data fields and one or two references ("links") pointing to the next and/or previous nodes.

The principal benefit of a linked list over a conventional array is that the order of the linked items may be different from the order that the data items are stored in memory or on disk, allowing the list of items to be traversed in a different order.

A linked list is a self-referential data type because it contains a pointer or link to another node of the same type.

Linked lists permit insertion and removal of nodes at any point in the list in constant time, but do not allow random access like array.

Several types of linked list :

1. Singly-Linked List
2. Doubly-Linked List
3. Circularly-Linked List

a. Single-Circularly-Linked List

b. Double-Circularly-Linked List