链表学习

单链表

设计链表的数据结构

typedef struct node
{
	int data;
	struct node *next;
};

创建单链表

node *creat(int value)
{
	node *head = NULL;
	head = (node*)malloc(sizeof(node));
	head->data = value;
	head->next = NULL;
	return head;
}

删除链表

void delete_node(node **pNode)
{
	node **pNext;
	if (NULL == pNode || NULL == *pNode)
		return;

	pNext = &(*pNode)->next;
	free(*pNode);
	delete_node(pNext);
}