单向链表的创建与遍历（先进先出和先进后出）

#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;

typedef struct node
{
int data;
struct node *next;
}NODE,*LinkList;
LinkList Createlist()
{
LinkList h,p,q;
p=(NODE *)malloc(sizeof(NODE));
h=p;
int x;
cin>>x;
if(x!=0)
{
q=(NODE *)malloc(sizeof(NODE));
q->data=x;
p->next=q;
p=q;
}
else if(x==0)
return NULL;
cin>>x;
while(x!=0)
{
q=(NODE *)malloc(sizeof(NODE));
q->data=x;
p->next=q;
p=q;
cin>>x;
}
q->next=NULL;
return h;
}
void outputlist(LinkList h)
{
LinkList q=h;
while(q!=NULL||q->next!=NULL)
{
q=q->next;
cout<<q->data<<endl;
}
}
void freelist(LinkList h)
{
LinkList q=h,p;
while(q!=NULL||q->next!=NULL)
{
p=q;
q=q->next;
free(p);
}
}
int main()
{
NODE *head;
head = Createlist();
outputlist(head);
freelist(head);
return 0;
}

#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;

typedef struct node
{
int data;
struct node *next;
} Node,*LinkList;
LinkList Createlist()
{
LinkList h,p;
int x;
cin>>x;
if(x!=0)
{
h=(Node *)malloc(sizeof(Node));
h->data=x;
h->next=NULL;
}
else if(x==0)
return NULL;
cin>>x;
while(x!=0)
{
p=(Node *)malloc(sizeof(Node));
p->data=x;
p->next=h;
h=p;
cin>>x;
}
return h;
}
void outputlist(LinkList head1)
{
LinkList p=head1;
while(p!=NULL)
{
cout<<p->data<<endl;
p=p->next;
}
}
void free(LinkList head1)
{
LinkList p=head1;
LinkList q=NULL;
while(p!=NULL)
{
q=p;
p=p->next;
free(q);
}
}
int main()
{
LinkList head;
head=Createlist();
outputlist(head);
free(head);
return 0;
}