C :

#include <stdio.h>
#define MAX 100
#define size 5
typedef char elemtype;
typedef struct seqlist
{
	elemtype elem[MAX];
	int last;
}Seqlist;

int main()
{
	struct seqlist l;
	int i;
	l.last=2*size-1;
	for(i=0;i<l.last;i++)
	{
		scanf("%c",&l.elem[i]);
		printf("%c",l.elem[i]);
	}
	printf("\n");
	for(i=l.last-1;i>=0;i--)
		printf("%c",l.elem[i]);
	printf("\n");
}

C++ :

#include <stdio.h>
#include <stdlib.h>
typedef char ElemType;
typedef struct Node
{
	ElemType data;
	struct Node * next;
}Node,*LinkList;

void CreateFromTail(LinkList L)
{
	int i;
	Node * s,*r;
	r=L;
	char c;
	for(i=0;i<9;i++)
	{
	s=(Node *)malloc(sizeof(Node));
	scanf("%c",&s->data);
	s->next=r->next;
	r->next=s;
	r=s;
	}
	r->next=NULL;
}
void Reverse_LinkList(LinkList L)  
{  
    Node *p, *q;  
    p = L->next;    //P指向链表第一个元素  
    L->next = NULL; //断开头结点与链表  
    while(p != NULL)  
    {  
        q = p;  
        p = p->next;  
        q->next = L->next;  //相当于前插法构建新的链表，和原来的相反  
        L->next = q;  
    }  
}
void show(LinkList L)	
{
	Node * r;
	r=L->next;
	while(r)
	{
		printf("%c",r->data);
		r=r->next;
	}
	printf("\n");
}
int  main()
{
	LinkList L;
	L=(Node *)malloc(sizeof(Node));
	L->next=NULL;
	CreateFromTail( L);
	show(L);
	Reverse_LinkList(L);
	show(L);
	return 0;
}