You are viewing a free preview of this lesson.
Subscribe to unlock all 10 lessons in this course and every other course on LearningBro.
This lesson covers linked lists — a fundamental dynamic data structure where elements are stored in nodes connected by pointers. Linked lists are a key topic in A-Level Computer Science and provide the foundation for understanding many other data structures.
A linked list is a dynamic data structure consisting of a sequence of nodes. Each node contains:
The first node is called the head. The last node's pointer is set to null (or None), indicating the end of the list.
HEAD → [Data|Next] → [Data|Next] → [Data|Next] → NULL
HEAD → [10|●] → [20|●] → [30|●] → NULL
This linked list contains three nodes storing the values 10, 20, and 30.
Subscribe to continue reading
Get full access to this lesson and all 10 lessons in this course.