Lists in C++ are part of the Standard Template Library (STL). A list is a sequence container that stores elements in a non-contiguous way using a doubly linked list structure.<\/p>\n\n\n\n
A list is a container that stores elements where each element is linked to the previous and next element. Unlike arrays or vectors, lists do not use continuous memory.<\/p>\n\n\n\n
Lists are useful because they:<\/p>\n\n\n\n
To use lists in C++, include the Lists allow insertion at both ends.<\/p>\n\n\n\n Lists do not support direct indexing like vectors or arrays.<\/p>\n\n\n\n You must use iterators.<\/p>\n\n\n\n Think of a chain of connected train compartments:<\/p>\n\n\n\n This is similar to how a list works.<\/p>\n\n\n\n Lists are used in:<\/p>\n\n\n\n Lists are important because they:<\/p>\n\n\n\n Lists in C++ are powerful STL containers based on doubly linked lists. They are best suited for applications that require frequent insertion and deletion. Although they do not support direct indexing, they provide high flexibility and efficiency for dynamic data handling.<\/p>\n\n\n<list><\/code> library.<\/p>\n\n\n\n#include <list><\/code><\/pre>\n\n\n\nDeclaring a List<\/h1>\n\n\n\n
list<int> numbers;<\/code><\/pre>\n\n\n\nInitializing a List<\/h1>\n\n\n\n
list<int> numbers = {10, 20, 30};<\/code><\/pre>\n\n\n\nAdding Elements in List<\/h1>\n\n\n\n
Example<\/h2>\n\n\n\n
numbers.push_back(40); \/\/ Add at end
numbers.push_front(5); \/\/ Add at beginning<\/code><\/pre>\n\n\n\nRemoving Elements from List<\/h1>\n\n\n\n
Example<\/h2>\n\n\n\n
numbers.pop_back(); \/\/ Remove last element
numbers.pop_front(); \/\/ Remove first element<\/code><\/pre>\n\n\n\nExample Program of List<\/h1>\n\n\n\n
#include <iostream>
#include <list>
using namespace std;
int main() {
list<int> numbers = {1, 2, 3};
numbers.push_front(0);
numbers.push_back(4);
for (int num : numbers) {
cout << num << endl;
}
return 0;
}<\/code><\/pre>\n\n\n\nOutput<\/h2>\n\n\n\n
0
1
2
3
4<\/code><\/pre>\n\n\n\nAccessing Elements in List<\/h1>\n\n\n\n
Example<\/h2>\n\n\n\n
for (auto it = numbers.begin(); it != numbers.end(); it++) {
cout << *it << endl;
}<\/code><\/pre>\n\n\n\nCommon List Functions<\/h1>\n\n\n\n
Function<\/th> Purpose<\/th><\/tr><\/thead> push_back()<\/code><\/td>Add element at end<\/td><\/tr> push_front()<\/code><\/td>Add element at beginning<\/td><\/tr> pop_back()<\/code><\/td>Remove last element<\/td><\/tr> pop_front()<\/code><\/td>Remove first element<\/td><\/tr> size()<\/code><\/td>Get number of elements<\/td><\/tr> clear()<\/code><\/td>Remove all elements<\/td><\/tr> empty()<\/code><\/td>Check if list is empty<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n Iterator Example with List<\/h1>\n\n\n\n
#include <iostream>
#include <list>
using namespace std;
int main() {
list<int> numbers = {10, 20, 30};
for (auto it = numbers.begin(); it != numbers.end(); it++) {
cout << *it << endl;
}
return 0;
}<\/code><\/pre>\n\n\n\nDifference Between List and Vector<\/h1>\n\n\n\n
Vector<\/th> List<\/th><\/tr><\/thead> Contiguous memory<\/td> Non-contiguous memory<\/td><\/tr> Fast random access<\/td> No random access<\/td><\/tr> Slower insertion in middle<\/td> Fast insertion\/deletion<\/td><\/tr> Better for indexing<\/td> Better for modifications<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n Important Points About Lists<\/h1>\n\n\n\n
\n
Advantages of Lists<\/h1>\n\n\n\n
\n
Common Mistakes with Lists<\/h1>\n\n\n\n
\n
numbers[0]<\/code>)<\/li>\n\n\n\nReal-Life Example<\/h1>\n\n\n\n
\n
Applications of Lists<\/h1>\n\n\n\n
\n
Why Lists are Important<\/h1>\n\n\n\n
\n
Conclusion<\/h2>\n\n\n\n