problem_013.cpp

//Write a program to reverse a linkedlist

#include<iostream>
#include<vector>
using namespace std;

struct Node{
    int data;
    struct Node* next;
};
void CreateList(struct Node* *root,int value){
    struct Node* ptr=*root;
    struct Node* temp= new Node();
    temp->data=value;
    temp->next=NULL;
    if(*root == NULL){
        *root=temp;
    }else{
        while(ptr->next !=NULL){
            ptr=ptr->next;
        }
        ptr->next=temp;
    }
}
void reverse(struct Node* root){
    struct Node* ptr= root;

    vector<int> v;

    while(ptr != NULL){
        v.push_back(ptr->data);
        ptr=ptr->next;
    }

     for (auto it = v.rbegin(); it != v.rend(); ++it) {
        cout << *it << "-> ";
    }
    cout<<endl;

}
void display(struct Node* root){
    struct Node* ptr=root;
    
    while(ptr!=NULL){
        cout<<ptr->data<<"->";
        ptr=ptr->next;
    }
    cout<<"Null"<<endl;
}
int main(){ 
    struct Node* root=NULL;

    CreateList(&root,12);
    CreateList(&root,15);
    CreateList(&root,17);
    CreateList(&root,22);
    
    reverse(root);


    return 0;
}