编程实现单链表的删除节点

// DataStructure.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"

typedef struct Student
{
	int data;
	Student * next;
}Node;

Node * create(int* data,int length){
	if (data==NULL||length<=0)
	{
		return NULL;
	}

	Node *head=NULL;
	Node *pre=NULL;
	for (int i = 0; i < length; i++)
	{
		Node *node=new Node();
		node->data=data[i];
		node->next=NULL;
		if (head==NULL)
		{
			head=node;
		}
		else
		{
			pre->next=node;
		}
		pre=node;
	}
	return head;
}

int length(Node *head){
	Node *p=head;
	int n=0;
	while (p!=NULL)
	{
		++n;
		p=p->next;
	}

	return n;
}

void print(Node *head){
	Node *p=head;
	while (p!=NULL)
	{
		printf("%d\t",p->data);
		p=p->next;
	}
	printf("\n");
}

Node * deleteNode(Node **head,int value){
	Node *p=*head;
	Node *pre=p;
	while (p!=NULL)
	{
		if (p->data==value)