main.c

数据结构自己写的单向链表的实现

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include "list.h"
#include "main.h"
void print(DataType data)
{
	printf("num= %d \t name: %s\n",data.num,data.name);
}
int insert(DataType old,DataType new)
{
	if(old.num < new.num)
		return 1;
	else 
		return 0;
}
int fre(DataType data)
{
	;
}
int Del_Cond(DataType data)
{
	if(4== data.num)
		return 1;
	else 
		return 0;
}
int main(int argc ,char **argv)
{
	int i;
	DataType stu;
	List *li;
	li = Create_List();
	for(i=0;i<5;i++)
	{
		stu.num = i*2;
		printf("pls enter students name:\n");
		scanf("%10s",stu.name);
		Add_Node(li,stu);
	}
	printf("============LIST IS:==============\n");
	Print_List(li,print);
	printf("============AFTER DELNODE:==============\n");
	Delete_Node(li,Del_Cond,fre);
	Print_List(li,print);
	printf("==============AFTER INVERT==============\n");
	Invert_List(li);
	Print_List(li,print);
	printf("============Insert Node:==============\n");
	DataType newdata;
	newdata.num = 8;
	strcpy(newdata.name,"zhangsan");
	Insert_Node(li,insert,newdata);
	Print_List(li,print);

}