删除单链表偶数节点

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

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

struct ListNode *createlist();
struct ListNode *deleteeven( struct ListNode *head );
void printlist( struct ListNode *head )
{
     struct ListNode *p = head;
     while (p) {
           printf("%d ", p->data);
           p = p->next;
     }
     printf("\n");
}

int main()
{
    struct ListNode *head;

    head = createlist();
    head = deleteeven(head);
    printlist(head);

    return 0;
}

/* 你的代码将被嵌在这里 */

/* 你的代码将被嵌在这里 */
struct ListNode *createlist()
{
	struct ListNode *head,*tail,*p;
	head=tail=NULL;
	int num;
	while(scanf("%d",&num) && num!=-1){
		p=(struct ListNode *)malloc(sizeof(struct ListNode));
		p->data=num;
		p->next=NULL;
		if(head==NULL && tail==NULL){
			head=tail=p;
		}
		else{
			tail->next=p;
			tail=p;
		}
	}
	return head;
}
struct ListNode *deleteeven( struct ListNode *head )
{
	struct ListNode *p,*q;
	//要删除的结点是表头结点
	while(head!=NULL && head->data % 2 == 0){	//不为空且是偶数
		q=head;
		head=head->next; 
		free(q);
	} 
	
	if(head==NULL)
		return NULL;
	
	//要删除的结点不是表头结点
	p=head;
	q=head->next;
	while(q){
		if(q->data%2==0){	//满足条件 删除 
			p->next=q->next;
			free(q);
		}
		else{				//不满足条件 p结点后移 
			p=q;
		}
		q=p->next;			//保持使 q指向 p 的下一个结点 
		
	}
	return head; 
}