#include<iostream>
#include<cstdlib>
using namespace std;
typedef struct Node
{
int date;
struct Node* pre;
struct Node* next;
}node;
node* creat(int n)
{
node* head = (node*)malloc(sizeof(node));
cin >> head->date;
head->pre = NULL;
head->next = NULL;
node* q=head;
for (int i = 0; i < n; i++)
{
node* p = (node*)malloc(sizeof(node));
cin >> p->date;
p->next = NULL;//此时尾节点其实就是p,所以要将尾节点的尾指针指向NULL
q->next = p;
p->pre = q;//将p的头指针指向前一个节点
q = q->next;//将q移到q的位置,方便,下一次输入将数据插入尾部
}
return head;
}
void print(node* head) {//遍历输出链表
node* p = head;
while (p != NULL) {//将链表从头开始打印
cout << p->date << " ";
p = p->next;//指向后一个节点
}
cout << endl;
p = head;
while (p->next != NULL)p = p->next;
node* q = p;//进行循环找到尾节点
while (q != NULL) {//从尾节点开始倒回来输出
cout << q->date << " ";
q = q->pre;//指向前一个节点
}
}
int main()
{
int n;
cin >> n;
node* head = creat(n);
print(head);//这个输出包含正向输出,也包括反向输出;
return 0;
}