Lists are sequence containers based on doubly linked list data structure concept that allow non-contiguous memory allocation.
As compared to vector, the list has slow traversal, but once a position has been found, insertion and deletion are quick.
“STL List” is “Doubly Linked List” while “STL Forward List” is “Singly Linked List”
Header file is <list> which provides list related features.
Declaring list
list<int> int_list;
this is a int_list list object.
