When learning programming languages, beginners usually learn arrays as the first data structure.

To access array elements, use the `arr[index]` syntax.

### Linked List

A linked list consists of **nodes**, where each node contains **data** and **a pointer** (or pointers) **to the next node** (or nodes in the case of a doubly linked list).

**The array elements are stored in memory sequentially.**

Linked list nodes can be **in different locations in memory**, which makes for more efficient memory usage, but can also result in more memory consumption due to pointer storage.


In the following chapters you will step by step implement a linked list with the necessary functionality.

The course covers the principles of creating and using structures, their memory and methods of data manipulation.

In this section you will learn what a structure is, why they exist and how to create them.

In this section we will review what pointers are, learn why pointers are used in structures and, most importantly, how this connection is implemented.

In this section, you'll learn how structures are stored in memory, see what alignment and padding are, and get acquainted with unions.

In this section you will learn about the features of nested structures, their application within other structures, get acquainted with anonymous structures and their application, and also superficially familiarize yourself with the most common data structures.

In this section you will implement a simple but very common data structure Linked List, and also create the necessary functions for working with the list.

C Structs

Introduction to Linked List

Array

Linked List