Зміст курсу

C Structs

1. Introduction to Structs

What are Structs Structs Application Defining and Declaring Structs Creating Your First Struct Accessing Struct Fields

2. Pointers and Structs

Pointers Brief Overview Pointers to Structs Pointers Inside Structs Dynamically Allocating Structs Passing Structs to the Functions

3. Structs and Memory

Understanding Memory Layout of Structs Alignment and Padding in Structs Unions Arrays with Structs

4. Advanced Structs Usage

Nested Structs Struct with Arrays and Other Structs Anonymous Struct and Union Complex Data Structure

5. Implementing Data Structures

Introduction to Linked List Basic Concept and Structure Building a Linked List Travesting and Displaying Linked List Completion Overview

Basic Concept and Structure

A linked list in C is a simple dynamic data structure consisting of elements called nodes. Each node contains data (such as a variable or object) as well as a pointer to the next node in the list.

Here's what a typical node in a singly linked list looks like in C:

If instead of a pointer to the next node you try to simply create an instance of a new node, you will get an error.

The compiler will not be able to allocate memory for such a structure, since it contains itself.

(It's like trying to look at yourself from the outside with your own eyes)

Using a pointer solves this problem because the compiler knows how much memory to allocate for a pointer variable.

Note
The last node pointer will always be NULL.

Завдання

Create a structure called Node;
Create a data field called data;
Create a field for a pointer to the next node.

Завдання

Create a structure called Node;
Create a data field called data;
Create a field for a pointer to the next node.

Перейдіть на комп'ютер для реальної практикиПродовжуйте з того місця, де ви зупинились, використовуючи один з наведених нижче варіантів

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

Секція 5. Розділ 2

Basic Concept and Structure

Here's what a typical node in a singly linked list looks like in C:

If instead of a pointer to the next node you try to simply create an instance of a new node, you will get an error.

The compiler will not be able to allocate memory for such a structure, since it contains itself.

(It's like trying to look at yourself from the outside with your own eyes)

Using a pointer solves this problem because the compiler knows how much memory to allocate for a pointer variable.

Note
The last node pointer will always be NULL.

Завдання

Create a structure called Node;
Create a data field called data;
Create a field for a pointer to the next node.

Завдання

Create a structure called Node;
Create a data field called data;
Create a field for a pointer to the next node.

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

Секція 5. Розділ 2

Basic Concept and Structure

Here's what a typical node in a singly linked list looks like in C:

If instead of a pointer to the next node you try to simply create an instance of a new node, you will get an error.

The compiler will not be able to allocate memory for such a structure, since it contains itself.

(It's like trying to look at yourself from the outside with your own eyes)

Using a pointer solves this problem because the compiler knows how much memory to allocate for a pointer variable.

Note
The last node pointer will always be NULL.

Завдання

Create a structure called Node;
Create a data field called data;
Create a field for a pointer to the next node.

Завдання

Create a structure called Node;
Create a data field called data;
Create a field for a pointer to the next node.

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

Here's what a typical node in a singly linked list looks like in C:

If instead of a pointer to the next node you try to simply create an instance of a new node, you will get an error.

The compiler will not be able to allocate memory for such a structure, since it contains itself.

(It's like trying to look at yourself from the outside with your own eyes)

Using a pointer solves this problem because the compiler knows how much memory to allocate for a pointer variable.

Note
The last node pointer will always be NULL.

Завдання

Create a structure called Node;
Create a data field called data;
Create a field for a pointer to the next node.

Секція 5. Розділ 2