//Reverse the Link List using recursion
struct node *head NULL;
void reverse(struct node *parent struct node *ptr)
{
if(ptr NULL)
return;
if(ptr->next ! NULL)
{
reverse(ptr ptr->next);
}
else
{
head ptr;
}

ptr->next parent;

}

function revLL(structNode **LL)
{
structNode *t1 t2 t3;
t1 *LL;
t2 t3 NULL;
while(t1!NULL)
{

t3 t2;

t2 t1;

t1 t1->next;

t2->Next t3;

}
*LL t2;
}

#include<iostream.h>
#include<stdio.h>
#include<conio.h>
class Node
{
public:
int data;
Node(int data);
Node *next;
void display();
};
Node::Node(int data)
{
this->data data;
}
void Node::display()
{
cout<<data<<" ";
}
class List
{
public:
Node* start;
List(){start NULL;}
void add(Node *node);
void display();
void reverse();
};
void List::reverse()
{
//a b and c points to 3 successive elements
Node *a NULL *b NULL *c start;

while(c! NULL)
{
//all of these pointers proceed one step ahead
a b;
b c;
c c->next;

if(b! NULL)// b has entered the list
{
b->next a;
}
//when the above loop was broken last element was pointing to second last
//let start now point to last element
start b;
}

}
void List::add(Node * node)
{
node->next start;
start node;
}
void List::display()
{
Node *ptr start;
while(ptr! NULL)
{
ptr->display();
ptr ptr->next;
}
cout<<endl;
}
void main()
{
clrscr();
List list ;
list.add(new Node(34));
list.add(new Node(23));
list.add(new Node(12));
list.add(new Node(8));
list.display();
list.reverse();
list.display();
getch();
}