How to reverse a link list without creating new list?

#include "stdafx.h"
#include <iostream>
using namespace std;

struct Node
{
    int Data;
    Node* Next;

    Node()
    {
        Data =-1;
        Next= NULL;
    }
};


int _tmain(int argc, _TCHAR* argv[])
{
    // fill data into link List
    Node* First= NULL, *Next=NULL,*Temp;

    for(int i =10;i<20;i++)
    {
        Temp = new Node();
        Temp->Data = i;

        Next = First;

        if(Next==NULL)
        {
            First = Temp;
        }
        else
        {
            while((Next->Next!=NULL))
            {
                Next=Next->Next;
            }
            Next->Next = Temp;
        }
    }


    //display data
    cout<<"Display Data"<<endl;
    Next = First;
    while((Next!=NULL))
    {
        cout<<Next->Data<<endl;
        Next=Next->Next;
    }
    // Reverse it  now


    Node* Last=NULL,*ltTemp;



    while(First->Next!=NULL)
    {

        ltTemp = First;
        Temp = First->Next;

        while((Temp->Next!=NULL))
        {
            if(Temp)
                Temp=Temp->Next;
            if(ltTemp)
                ltTemp= ltTemp->Next;
        }
        // Plug the last one
        ltTemp->Next= NULL;

        // Place in reverse order

        if(Last== NULL)
        {
            Last=Temp;

        }
        else
        {
            Next = Last ;
            while((Next->Next!=NULL))
            {
                Next=Next->Next;
            }
            Next->Next = Temp;
        }
    }

    if(Temp)
        Temp->Next= First;

    //display data
    cout<<"Display Data reverse order"<<endl;
    Next = Last;
    while((Next!=NULL))
    {
        cout<<Next->Data<<endl;
        Next=Next->Next;
    }

    /// delete all the allocated memory
    Next = First;
    if(Next)
    while((Next!=NULL))
    {
        Temp = Next;
        Next=Next->Next;
        delete Temp;
    }

    if(Next)
        delete Next;

}