list pop back() and front() function in c++














































list pop back() and front() function in c++



list::pop_back():This is a built-in function in C++  which is used to remove an element from the back of a list container. That is, this function deletes the last element of a list container. This function thus decreases the size of the container by 1 as it deletes an element from the end of list.

list::pop_front():- This is a built-in function in C++  which is used to remove an element from the front of a list container. This function is same in functioning as pop back but it deletes the element from the front of the list 

Sample program to show use of both function :-

#include <bits/stdc++.h> using namespace std; int main() { // Creating a list list<int> demoList; // Adding elements to the list // using push_back() demoList.push_back(10); demoList.push_back(20); demoList.push_back(30); demoList.push_back(40); // Initial List: cout << "Initial List: "; for (auto itr = demoList.begin(); itr != demoList.end(); itr++) cout << *itr << " "; // removing an element from the end of List // using pop_back demoList.pop_back(); // List after removing element from end cout << "\n\nList after removing an element from end: "; for (auto itr = demoList.begin(); itr != demoList.end(); itr++) cout << *itr << " "; demoList.pop_front(); // List after removing element from front cout << "\n\nList after removing an element from front: "; for (auto itr = demoList.begin(); itr != demoList.end(); itr++) cout << *itr << " "; return 0; }
OUTPUT:-

AS u can see here when we used the pop back func it removed 40 which was at last and when we used the front func it removed 10 which was in starting.


More Articles of Karan Kumar:

Name Views Likes
list pop back() and front() function in c++ 274 0
difftime() in c++ 161 0
partition_point in C++ 152 0
multimap::erase() and multimap find() in C++ 160 0
multimap::crbegin() and multimap::crend() in C++ 156 0
forward_list::cbefore_begin() in C++ 143 0
forward_list::unique() in C++ 147 0
round() in C++ 165 0
odd-even sort in c++ 1112 0
Composite Design Pattern in C++ 232 0
deque::emplace_front() and back() in C++ 137 0
deque::begin() and deque::end in C++ 144 0
deque::at() and deque::swap() in C++ 149 0
deque::operator= and deque::operator[] in C++ 127 0
Deque::empty() and deque::size() in C++ 145 0
deque clear and erase function in c++ 166 0
Deque front and back () function in c++ 155 0
deque push front()/back() in c++ 125 0
deque resize() in c++ 143 0
Deque assign() function in c++ 131 0
Deque maxsize() and cbegin() 175 0
Deque rbegin function in c++ 175 0
Deque insert() function in C++ 166 0
Deque in C++ Standard Template Library 176 0
C/C++ Program for First Come First Served (FCFS) Algorithm 4850 1

Comments