链表之节点查找

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


struct test
{
   
	int data;
	struct test *next;
};

void printLink(struct test *head)
{
   
	struct test *point;
	point = head;
	while(point!=NULL)
	{
   
		printf("%d",point->data);
		point=point->next;
	}
	putchar('\n');
}
int getJieDian(struct test *head)//寻找节点数 
{
   
	int cnt=0;
	while(head!=NULL)
	{
   
		cnt++;
		head=head->next;
	}
	return cnt;