Reverse a stack using recursion

#1

nto able to identify the error

#2

hi @amishatinni_6d07a38b7467ac6d code is correct just take input like shown here

int main()
{
    stack<int> s;
	int n;
	cin>>n;
	while(n--){
		int x;
		cin>>x;
		s.push(x);
	}
	
	reversestack(s);
	while(!s.empty())
	{
		cout<<s.top()<<endl;
		s.pop();
	}
    return 0;
}
#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.