/*****************************************
** This program demonstrates a recursive
** approach to producing a copy of a list,
** i.e. a new list whose nodes have all
** the same values in the same order.
** Doing this iteratively is more difficult!
*****************************************/
#include <iostream>
using namespace std;

/*****************************************
** Class def's and function prototypes
*****************************************/
class Node
{
public:
double data;
Node *next;
};

void printlist(Node* L);
Node* copy(Node* L);

/*****************************************
** MAIN
*****************************************/
int main()
{
// Get original list of values from user
Node *L = 0;
double x;
while(cin >> x)

// Make copy
Node *Lp = copy(L);

// Print both to show they're the same!
printlist(L);
cout << endl;
printlist(Lp);
cout << endl;

return 0;
}

/*****************************************
** Function definitions
*****************************************/
Node* copy(Node* L)
{
// BASE CASE
if (L == 0)
return 0;

// RECURSIVE CASE
Node *C = copy(L->next);
return C;
}

{
Node *T = new Node;
T->data = val;
T->next = L;
L = T;
}

void printlist(Node* L)
{
if (L != 0)
{
cout << L->data << ' ';
printlist(L->next);
}
}