链表

1创建

2查询

node *pRead = head;
while (pRead != NULL)
{
　　if (pRead->data == key_word)
　　return pRead;
　　pRead = pRead->next;
}
return NULL;

3清空

node *p;
while (head != NULL)
{
　　p = head;
　　head = head->next;
　　delete p;
}

4插入（尾部）

node *newNode = new node;
newNode->data = newData;
newNode->next = NULL;
if (head == NULL)
{
　　Head = newNode;
}
else
{
　　Node *pRead = Head;
　　while (pRead->next != NULL)
　　{
　　　　pRead = pRead->next;
　　}
　　pRead->next = newNode;
}