Grokking Data Structures & Algorithms for Coding Interviews
Ask Author
Back to course home

0% completed

Introduction to LinkedList
Table of Contents

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

A linked list consists of nodes that are connected sequentially. Each node contains:

  1. Data – The value stored in the node.
  2. Pointer (Next Reference) – A reference to the next node in the list.

A linked list always has a starting point (Head) and may have an ending point (Tail), depending on the type of linked list. If a node does not point to another node, its reference is set to NULL.

Key Components of a Linked List

1. Node

A node is the building block of a linked list. Each node consists of two parts:

.....

.....

.....

Like the course? Get enrolled and start learning!

Table of Contents

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible

Contents are not accessible