#include<iostream>
using namespace std;
typedef int ElemType;
//双链表的定义
typedef struct DNode{
ElemType data;
struct DNode *prior;
struct DNode *next;
}DNode,*DLinkList;
DLinkList D_head_int(DLinkList &DL){
DNode *s;
int x;
DL=(DLinkList)malloc(sizeof(DNode));
DL->next=NULL;
DL->prior=NULL;
cin>>x;
while(x!=9999){
s=(DLinkList)malloc(sizeof(DNode));//申请一个空间
s->data=x;
s->next=DL->next;
if(DL->next!=NULL){
DL->next->prior=s;
}
s->prior=DL;
DL->next=s;
cin>>x;
}
return DL;
}
void PrintDList(DLinkList DL){
DL=DL->next;
while(DL!=NULL){
cout<<DL->data<<"\t";
DL=DL->next;
}
//cout<<"\t";
}
int main(){
DLinkList DL;
D_head_int(DL);
PrintDList(DL);
}