Chapter 5, Problem 6R

Explanation of Solution

Program code:

//include the required header files

#include<bits/stdc++.h>

#include <iostream>

//use the std namespace

using namespace std;

//create a stack

stack<int> s;

//define a method recursive_remove()

void recursive_remove()

{

//checking the stack is empty or not

if(s.empty())

{

//return

return;

}

//print the statement

cout<<"removing "<<s.top()<<"...."<<endl;

//pop an element

s.pop();

//call the method recursive_remove()

recursive_remove();

}

//define main method

int main()

{

//push the elements to the stack

s.push(5);

s.push(4);

s.push(3);

s.push(2);

s.push(1);

//call the method recursive_remove()

recursive_remove();

//checking the stack is empty or not

if(s.empty())

{

//print the statement

cout<<"elements are removed successfully!!";

}

//if the statement is not empty

else

{

//print the statement

cout<<"failed...