reverseList

#include <iostream>
#include <stack>

using namespace std;

struct node{
    int data;
    node *next;
};

node *head=NULL;
node *last=NULL;

void Insert (int);
void reverseList ();
void PrintList ();
int main() {
	int n,d;
	//cout<<"Enter the no of nodes in linked list"<<endl;
	cin>>n;
	
	//cout<<"Enter the data one by one"<<endl;
	
	for(int i=0;i<n;i++){
	    cin>>d;
	    Insert(d);
	}
	
	reverseList();
	PrintList();
	return 0;
}

void PrintList(){
    node *ptr=head;
    
    while(ptr!=NULL){
        cout<<ptr->data<<" ";
        ptr=ptr->next;
    }
}


void Insert(int d){
    node *ptr;
    ptr=new node();
    ptr->data=d;
    ptr->next=NULL;
    
    if(head==NULL){
        head=ptr;
        last=head;
        return;
    }
    last->next=ptr;
    last=ptr;
}

void reverseList(){
    stack<node *> s;
    node *ptr=head;
    
    while(ptr!=NULL){
        s.push(ptr);
        ptr=ptr->next;
    }
    
    head=s.top();
    s.pop();
    ptr=head;
    while(!s.empty()){
        ptr->next=s.top();
        s.pop();
        ptr=ptr->next;
    }
    
    ptr->next=NULL;
}