recursion for reverse a sentence by linked list

[yeah110]

This program is to print a sentence in an opposite way by putting the world into a linked list one by one.


For the print(),it is required to use recursion rather than while-loop but I do not know how to implement recursion as well as the linked list.
Anyone could help?

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

class word
{
public:
	void print()
	{
		word *cc;
		cc = this;
		do
		{
			
			for (int i=0;cc->thisw[i]!='\n';i++)
				cout<<cc->thisw[i];
			cout<<" ";
			cc = cc->pre;
		}while(cc);
	}
	
	word()
	{
		next = 0;
		pre = 0;
	}
	word* next;  //
	word* pre;
	char thisw[100];
};

int main()
{
	char s;
	char stop = '.';
	int count=0;
	int isz=1;
	word *my = new word;               //save pointer in my
	while((s=getchar())!='\n')
                                     //to check if stop by checking if there is a full stop
    {
		if(s=='.')
		{
			my->thisw[count] = '\n'; //
			my->next = 0;
			break;
		}
		isz = 0;
		if(s!=' ')
		{
			my->thisw[count] = s;    //
			count = count+1;
		}
		else
		{
			my->thisw[count] = '\n';
			count = 0;
			my->next = new word;
			my->next->pre = my;
			my = my->next;
		}
	}
	my->thisw[count] = '\n';
	if(!isz)
	{
		cout<<"The list is:"<<endl;
		my->print();

	}
	return 0;
}