单链表的创建与遍历-C语言

//单链表的创建与遍历
#include <stdio.h>
#include <stdlib.h>
struct node
{
	int data;
	struct node *next;
};
typedef struct node Node;
int main()
{
	Node *head, *p, *q;
	p = (Node *)malloc(sizeof(Node));
	p->data = 20;
	head = p;
	//单链表的创建 
	for(int i = 1; i <= 3; i++)
	{
		q = (Node *)malloc(sizeof(Node));
		q->data = (i + 2)*10;
		p->next = q;    //把新创建的接到链表上 
		p = q;
	}
	p->next = NULL;
	printf("链条的头指针值是：%#X\n", head);
	printf("链条节点的地址：");
	//链表的遍历 
	for(Node *p = head; p != NULL; p = p->next)
	{
		printf("%#X ", p);
//		printf("%#X ", p->next);
	} 
	printf("\n");
	printf("链条节点的内容：");
	for(Node *p = head; p != NULL; p = p->next)
	{
		printf("%d  %#X  ", p->data, p->next);
	} 
	return 0;
}