双向链表（差不多）

#include <iostream>
#include <cstdlib>
using namespace std;
typedef struct node
{
    int date ;
    node *pri;
    node *next;
}*linklist,listnode;
linklist creatlist(int num)
{
    linklist head=NULL,temp=NULL,tail=NULL;
    int i;
    for(i=0;i<num;i++)
    {
        if(head==NULL)
        {
            head=(linklist)malloc(sizeof(listnode));
            cin>>head->date;
            head->pri=NULL;
            tail=head;
        }
        else
        {
            temp=(linklist)malloc(sizeof(listnode));
            cin>>temp->date;
            temp->pri=tail;
            tail->next=temp;
            tail=temp;
            tail->next=NULL;

        }
    }
    return head;
}
linklist outputlist(linklist head)
{
    linklist p=head,tail;
    while(p!=NULL)
    { 
        cout<<p->date<<' ';
        tail=p;
        p=p->next;
    }
    return tail;
}
void _outputlist(linklist tail)
{
    linklist p=tail;
    while(p!=NULL)
    {
        cout<<p->date<<' ';
        p=p->pri;
    }
}
int main()
{
    linklist head,tail;
    int num;
    cin>>num;
    head=creatlist(num);
    tail=outputlist(head);
    cout<<endl;
    _outputlist(tail);
}