102th_stack.cpp

//INCOMPLETE
/*
Problem Statement: Reverse a Stack
Problem Level: MEDIUM
Problem Description:
You have been given two stacks that can store integers as the data. Out of the two given stacks,
one is populated and the other one is empty.
You are required to write a function that reverses the populated stack using the one which is empty.
For Example:

Input Format :
The first line of input contains an integer N, denoting the total number of elements in the stack.

The second line of input contains N integers separated by a single space, representing the order in which
the elements are pushed into the stack.

Output Format:
The only line of output prints the order in which the stack elements are popped, all of them separated by a single space.

Note:
You are not required to print the expected output explicitly, it has already been taken care of. Just make
the changes in the input stack itself.

Constraints:
1 <= N <= 10^3
-2^31 <= data <= 2^31 - 1

Time Limit: 1sec

Sample Input 1:
6
1 2 3 4 5 10

Note:
Here, 10 is at the top of the stack.

Sample Output 1:
1 2 3 4 5 10

Note:
Here, 1 is at the top of the stack.

Sample Input 2:
5
2 8 15 1 10

Sample Output 2:
2 8 15 1 10
*/

//revrese a stack with just using one stack 
//we will use recursion as the third stack as recursion also uses stack internally

#include<bits/stdc++.h>
using namespace std;

stack<int> reverse_stack(stack<int> s1,stack<int> s2)
{
    if(s1.empty())
    {
        return s1;
    }
    else
    {
        
    }
}
int main()
{
    int n;
    cout<<"Enter size of stack : "<<endl;
    cin>>n;
    stack<int> s1;
    stack<int> s2;
    for(int i=1;i<=n;i++)
    {
        int x;
        cout<<"Enter the number : ";
        cin>>x;
        s1.push(x);
    }
    s1=reverse_stack(s1,s2);
    cout<<endl;
    while(!s1.empty())
    {
        cout<<s1.top()<<" ";
        s1.pop();
    }
}