10. What You Will Learn in Volume 2
152.3.1. What Is a Linked List?
20.1. Benefits of learning about algorithms and data structures
162.3.2. Adding Nodes to a Linked List
30.2. Course Structure
172.3.3. Bonus Algorithm Code
42. Introduction to Data Structures
182.4. Circularly Linked lists
52.1. Course Overview
192.4.1. Representation
62.2. Exploring Arrays
202.4.2. Advantages of circularly linked lists over singly linked lists
72.2.1. Array Basics
212.5. Doubly Linked Lists
82.2.2. Accessing a Value in an Array
222.5.1. Representation of a doubly linked list
92.2.3. Practice Exercise 1
232.5.2. Advantages of a Doubly Linked List
102.2.4. Answers to Practice Exercise 1
242.5.3. Disadvantages of a Doubly Linked List
112.2.5. Array Search, Insert and Delete
252.5.4. Multiply Linked List
122.2.6. Practice Exercise 2
262.5.5. Unrolled Linked List
132.2.7. Answers to Practice Exercise 2
272.6. Download Training Resources
142.3. Building a Linked List