demo9.7链表从指定节点前方插入新节点（附加逆向排序）.c

#include <stdio.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 getNodesum(struct Test *head)//统计链表节点个数
{
   
   
	int count = 0;
	while(head != NULL){
   
   
		count++;
		head = head->next;
	}
	return count;
	
}
int searchNode(struct Test *head,int data)//查找指定的值是否在链表中
{
   
   
	while(head !=NULL ){
   
   
		if(head->data == data){
   
   
			return 1