reverseALinkedlistORIGINAL.cpp

#include <bits/stdc++.h>
//use #include<stdio.h> for C
#define st struct stu


using namespace std;    //remove this line for C

struct stu
{
    int roll;
    int marks;
    struct stu *next = NULL;
};

int main()
{
    struct stu *start=NULL, *newNode, *currNode=NULL;
    char p='y';
    int i=1;

    //create

    while(p == 'y' || p == 'Y')
    {
        printf("Enter node %d\n",i++);
        newNode=(struct stu*)malloc(sizeof(struct stu));
        scanf("%d%d", &newNode->roll, &newNode->marks);
        if(start==NULL)
        {
            start=newNode;
        }
        else
        {
            currNode->next=newNode;
        }
        currNode=newNode;
        printf("Do you wanna add more nodes?(Y/N)");
        fflush(stdin);
        cin>>p;
        }

    printf("\n");

    //display

    struct stu *latestNode=NULL;
    latestNode = start;
    do
    {
        printf("Roll no %d got %d marks\n", latestNode->roll, latestNode->marks);
        latestNode = latestNode->next;
    }while(latestNode->next != NULL);

    if (latestNode->next == NULL)
    {
        printf("Roll no %d got %d marks\n", latestNode->roll, latestNode->marks);
    }


    //reversal


    st *prev=NULL, *temp = start, *next;
    while(temp!=NULL)
    {
        next = temp->next;
        temp->next = prev;
        prev = temp;
        temp = next;
    }

    start = prev;


    //display the reversed linkedList


    printf("\n\nThe reversed linkedList is:\n\n");


    latestNode=NULL;
    latestNode = start;
    do
    {
        printf("Roll no %d got %d marks\n", latestNode->roll, latestNode->marks);
        latestNode = latestNode->next;
    }while(latestNode->next != NULL);

    if (latestNode->next == NULL)
    {
        printf("Roll no %d got %d marks\n", latestNode->roll, latestNode->marks);
    }



    return 0;
}