linked list stl code example

Example 1: list in cpp

//code by Soumyadeep Ghosh
//ig: @soumyadepp

#include <bits/stdc++.h>

using namespace std;

void display_list(list<int>li)
{
  //auto variable to iterate through the list
  for(auto i:li)
  {
    cout<<i<<" ";
  }
}
int main()
{
  //definition
  list<int>list_1;
  int n,x;
  cin>>n;
  //taking input and inserting using insert function
  for(int i=0;i<n;i++)
  {
    cin>>x;
    list_1.insert(x);
  }
  //if list is not empty display it
  if(list_1.empty()==false)
  {
    display_list(list_1);
  }
  list_1.sort(); //sorts the list
  list_1.reverse(); //reverses the list
  list_1.pop_back(); //deletes last element of the list
  list_1.pop_front(); //deletes the first element of the list
  
  display_list(list_1);  //function to display the list
  
  
  return 0;
}
//in addition , you can use nested lists such as list<list<int>> or list<vector<list>> etc

Example 2: linked list in c++ stl

#include <bits/stdc++.h>
#include <iostream>
#include <list>
#include <iterator>

#define ll long long

using namespace std;

//function to print all the elements of the linked list
void showList(list <int> l){
	list <int> :: iterator it; //create an iterator according to the data structure
	for(it = l.begin(); it != l.end(); it++){
		cout<<*it<<" ";
	}
	
}	


int main(){
	
	list <int> l1;
	list <int> l2;
	
	for(int i=0; i<10; i++){
		l1.push_back(i*2); //fill list 1 with multiples of 2
		l2.push_back(i*3); //fill list 2 with multiples of 3
	}
	
	cout<<"content of list 1 is "<<endl;
	showList(l1);
	cout<<endl;
	
	cout<<"content of list 2 is "<<endl;
	showList(l2);
	cout<<endl;
	
	//reverse the first list
	l1.reverse();
	showList(l1);
	cout<<endl;
	
	//sort the first list
	l1.sort();
	showList(l1);
	cout<<endl;
	
	//removing an element from both sides
	l2.pop_front();
	l2.pop_back();
	
	//adding an element from both sides
	l2.push_back(10);
	l2.push_front(20);
	
	
    return 0;
}

Example 3: list stl

template < class T, class Alloc = allocator<T> > class list;