9.4链表静态添加和动态遍历

 

#include <stdio.h>

struct Student
{
	char *name;
	int age;
	int aihao;
	int(*p)(int age);
	struct Student *next;
}
struct Test
{
	int data;
	struct Test *next;
};


void printLink(struct Test *head)//看前一位是data，后以为暂时为空，之后再定义一次，将数据刚给道next
{
	struct Test *point;
	point = head;
	while(point != NULL){
		
	printf("%d ",point->data);
	point = point->next;
	
	}
	putchar('\n');
}
int main()
{
	int i;

	int array[] = {1,2,3};
	for(i=0;i<sizeof(array)/sizeof(array[0]);i++){
		printf("%d ",array[i]);
	}
	putchar('\n');

	struct Test t1 = {1,NULL};//结构体初始化，定义时赋值，（注意位置要对应）
	struct Test t2 = {2,NULL};
	struct Test t3 = {3,NULL};
	struct Test t4 = {4,NULL};
	struct Test t5 = {5,NULL};
	struct Test t6 = {6,NULL};

	t1.next = &t2;//定义后逐个赋值
	t2.next = &t3;
	t3.next = &t4;
	t4.next = &t5;
	t5.next = &t6;

	printf("use t1 to print three num\n");
//	printf("%d %d %d\n",t1.data,t1.next->data,t1.next->next->data);
	printLink(&t1);
	return 0;
}

输出结果

先将head给point，然后判断point内的数据是否为空否则，印数据，下一个数据