数据结构 单链表的简单实现及各个功能（非模板类定义）

关于各个功能还会不断加入，这个主要是放在这里自己看+刷流量

#include <iostream>
#include <cstdlib>
using namespace std;

struct node
{
	int value; 
	struct node *next;
}; 

node *jianli()
{
	struct node *head;
	head = (node *)malloc(sizeof(node));
	head->value = 0; 
	head->next = NULL;
	return head;
}
void weichafa(int x,struct node* head)
{
	struct node *p;
	p = (node *)malloc(sizeof(node));
	p->value = x;
	p->next = NULL;
	if(head==NULL)//如果头是空的 
	{
		printf("非法插入！"); 
	}
	else
	{
		struct node *q;
		q = head;
		while(q->next!=NULL)
		{
			q = q->next;
		}
		q->next = p;
		q = q->next;
	}
	return ;
}
void print(node *head)
{
	struct node *p;
	p = head->next;
	while(p!=NULL)
	{
		printf("%d\t",p->value);
		p = p->next;
	}
	return ; 
} 
int main(void)
{
	struct node* headd;
	headd = jianli();
	weichafa(1,headd);
	weichafa(2,headd);
	weichafa(4,headd);
	print(headd);
}