Introduction to std::list in C++

Welcome! In this lesson, we'll explore C++'s std::list, a crucial component of the Standard Template Library (STL). The std::list provides an efficient way to implement data structures that require constant-time insertions and deletions from any part of the sequence. We'll learn how to use this class to perform operations on linked lists effectively.

C++'s std::list is a part of the <list> header and represents a doubly-linked list. This structure comprises nodes that contain references to both the previous and next nodes in the sequence, allowing for convenient bidirectional traversal. While offering flexibility in navigation, it also entails increased complexity and memory usage due to the additional pointers.

To work with std::list in C++, we start by including the <list> header and creating an instance of std::list:

#include <iostream>
#include <list>
#include <string>

int main() {
    std::list<std::string> students;
    return 0;
}

In this code, we've set up a std::list called students to store elements of type std::string. The list is currently empty, and we'll explore adding elements and performing other operations next.

C++'s std::list provides several useful functions to manipulate the list:

• push_back(const T& value): Appends an element to the end of the list.
• push_front(const T& value): Inserts an element at the beginning of the list.
• pop_front(): Removes the first element of the list.

These functions are demonstrated in the following code:

#include <iostream>
#include <list>
#include <string>

int main() {
    std::list<std::string> students;

    students.push_back("John");
    students.push_front("Alice");

    std::cout << students.front() << std::endl;  // prints Alice
    students.pop_front();
    std::cout << students.front() << std::endl;  // prints John

    return 0;
}

Traversing a std::list in C++ can be elegantly achieved using iterators in a for loop to visit each node:

#include <iostream>
#include <list>
#include <string>

int main() {
    std::list<std::string> students;

    students.push_back("John");
    students.push_back("Alice");

    for (const std::string& student : students) {
        std::cout << student << std::endl;
    }
    /*
    Output:
    John
    Alice
    */

    return 0;
}