c/c++单链表

11/要求以头插法建立单链表（c；c++）

#include <stdio.h>
#include <stdlib.h>

typedef int ElemType;
typedef struct LNode
{
ElemType data;
struct LNode *next;
}LNode,*LinkList;

LinkList Create();
void print( LinkList L);

int main()
{
LinkList L = Create();
print(L);
return 0;
}
LinkList Create()
{
LinkList L,s;
ElemType e;
L = (LinkList)malloc(sizeof(LNode));
L->next=NULL;
scanf("%d",&e);
while(e!=-1)
{
s = (LinkList)malloc(sizeof(LNode));
s->data=e;
s->next=L->next;
L->next=s;
scanf("%d",&e);
}
return L;
}
void print(LinkList L)
{
LinkList p;
p=L->next;
while §
{
printf("%d ", p->data);
p =p->next;
}
}

2/要求利用尾插法建立单链表

**
#include <stdio.h>
#include <stdlib.h>
typedef struct LNode
{
int data;
struct LNode *next;
}LNode, *LinkList;
LinkList Create();
void print(LinkList L);
int main()
{
LinkList L = Create();
print(L);
return 0;
}
LinkList Create()
{
LinkList L, p, s;
int e;
L = (LinkList)malloc(sizeof(LNode));
L->next = NULL;
p = L;
scanf("%d", &e);
while (e != -1)
{
s = (LinkList)malloc(sizeof(LNode));
s->data = e;
p->next=s;
p = s;
scanf("%d", &e);
}
p->next = NULL;
return L;
}
void print(LinkList L)
{
LinkList p;
p = L->next;
while §
{
printf("%d ", p->data);
p = p->next;
}
}