链表的一些内容
概念:链表是线性表的链接存储表示。
特点:
1.每个元素由结点构成;
2.线性结构;
3.结点可以连续,可以不连续存储;
4.结点的逻辑顺序和物理顺序可以不一致;
5.表可以扩充;
代码:
#include <stdio.h>
#include <stdlib.h>
struct node
{
int num;
struct node * next;
};
typedef struct node Node;
typedef struct node* Link;
void create_link(Link * head)
{
* head = NULL; //创建空链表
}
void insert_node_head(Link *head,Link new_node) //头插
{
new_node -> next = *head;
*head = new_node;
}
void insert_node_tail(Link *head,Link new_node) //尾插
{
Link p;
p = *head;
if(*head == NULL)
{
*head = new_node;
new_node -> next = NULL; //将尾结点置空
}
else
{
while(p -> next != NULL)
{
p = p -> next;
}
p -> next = new_node;
new_node -> next = NULL; //尾结点置空
}
}
void display_link(Link head)
{
Link p;
p = head;
if(head == NULL)
{
printf("link is empty!\n");
return;
}
while(p != NULL)
{
printf("%d\n",p -> num);
p = p -> next;
}
}
void create_node(Link * new_node) //分配空间
{
*new_node = (Link)malloc(sizeof(Node));
if(*new_node == NULL)
{
printf("malloc error!");
exit(-1);
}
}
void release_link(Link *head) //释放
{
Link p;
p = *head;
while(*head != NULL)
{
*head = (*head) -> next;
free(p);
p = *head;
}
}
void insert_node_mid(Link *head,Link new_node,int loc) //中间插入值
{
Link p,q;
p = q = *head;
if((*head) -> num == loc)
{
new_node -> next = *head;
*head = new_node;
}
else
{
while(p != NULL && p -> num != loc)
{
q = p;
p = p -> next;
}
q -> next = new_node;
new_node -> next = p;
/* if(p == NULL)
{
q -> next = new_node;
new_node -> next = NULL;
}
else
{
q -> next = new_node;
new_node -> next = p;
}
*/
}
}
int main()
{
Link head = NULL;
Link new_node = NULL;
int i;
int loc;
create_link(&head); //创建一个空链表
for(i = 0;i < 10;i++)
{
//new_node = (Link)malloc(sizeof(Node));
create_node(&new_node);
new_node -> num = i + 1;
//insert_node_head(&head,new_node);//头插
insert_node_tail(&head,new_node);//尾插
}
display_link(head);
create_node(&new_node); //分配一个新的结点
printf("输入一个数给新的结点:\n");
scanf("%d",&new_node -> num);
printf("输入插入的位置:\n");
scanf("%d",&loc);
insert_node_mid(&head,new_node,loc); //中间插入
display_link(head);
release_link(&head);
display_link(head);
return 0;
}