How do I use iterators with std::list in C++?

How do I use iterators with std::list in C++?

You can use iterators to traverse a std::list in C++. Here's a simple example:

#include <iostream>
#include <list>

int main() {
    std::list<int> myList = {1, 2, 3, 4, 5};
    for (auto it = myList.begin(); it != myList.end(); ++it) {
        std::cout << *it << " ";
    }
    return 0;
}

This code will print the elements of the list.

What are the advantages of using std::list over std::vector?

std::list is a doubly linked list, which allows for efficient insertions and deletions from anywhere in the list. In contrast, std::vector is a dynamic array, which provides fast access to elements but can be slower for insertions and deletions, especially in the middle of the container.

Can I use reverse iterators with std::list?

Yes, you can use reverse iterators with std::list. You can access the elements in reverse order using rbegin() and rend(). Here's an example:

for (auto it = myList.rbegin(); it != myList.rend(); ++it) {
    std::cout << *it << " ";
}

What happens if I try to access an element out of bounds?

Accessing an element out of bounds with iterators will lead to undefined behavior. It's important to ensure that your iterators are valid and within the range of the list.