静态链表代码实现

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

typedef struct node
{
	struct node *prev;
	int data;
	struct node *next;

}NODE, * PNODE;
int main() {
	PNODE header = NULL;
	PNODE pa = (PNODE)malloc(sizeof(NODE));//创建存储空间（堆空间）
	PNODE pb = (PNODE)malloc(sizeof(NODE));
	PNODE pc = (PNODE)malloc(sizeof(NODE));
	PNODE pd = (PNODE)malloc(sizeof(NODE));
	pa->data = 1;
	pb->data = 2;
	pc->data = 3;
	pd->data = 4;

	//链接结点
	header = pa;
	pa->next = pb;
	pb->next = pc;
	pc->next = pd;
	//pd->next = NULL; 该步可以不写

	//4.遍历链表  头不动 尾不动
	{
		PNODE p = header;
		while (p != NULL)
		{
			printf("%d\n", p->data);
			p = p->next; //将p的下一个结点赋值给p
		}

	}




	return 0;
 }