19.1单链表

#include

typedef struct Node
{
	int data;//数据
	struct Node* next;//指向后继节点

}Node;
main()
{
	Node n1 = { 1 };
	Node n2 = { 2 };
	Node n3 = { 3 };

	//链接起来
	n1.next = &n2;
	n2.next = &n3;
	n3.next = NULL;

	//从n1开始逐个访问
	Node* curNode = &n1;
	while (curNode != NULL)
	{
		printf("%d", curNode->data);
		curNode = curNode->next;

	}
	printf("n");
	printf("&n1:%p &n2:%p &n3:%pn", &n1, &n2, &n3);
	printf("next n1:%p n2:%p n3:%pn", n1.next, n2.next, n3.next);

	return 0;
}