Notice: This page requires JavaScript to function properly.
Please enable JavaScript in your browser settings or update your browser.
Introduction to Linked List | Implementing Data Structures
C Structs
course content

Зміст курсу

C Structs

C Structs

1. Introduction to Structs
2. Pointers and Structs
3. Structs and Memory
4. Advanced Structs Usage
5. Implementing Data Structures

bookIntroduction to Linked List

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

Array

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.

What is a singly linked list?

What is a singly linked list?

Виберіть правильну відповідь

Все було зрозуміло?

Як ми можемо покращити це?

Дякуємо за ваш відгук!

Секція 5. Розділ 1
some-alt