C++数据结构-链表

---

一、C++数据结构-链表 二、使用步骤

代码如下（示例）：

#include 
using namespace std;

//创建一个单链表
class ListNode
{
public:
	int data;
	 ListNode* next;
};
void  creatList(ListNode * headnode )
{
	ListNode* p = headnode;
	for (int i = 1; i < 10; i++)
	{
		ListNode* pNewNode = new ListNode;
		pNewNode->data = i;
		pNewNode->next = NULL;
		p->next = pNewNode;
		p = pNewNode;
	}

}

void printlist(ListNode* headnode)
{
	ListNode* p = headnode;
	while (p != NULL)
	{
		cout << p->data << " ";
		p = p->next;
	}
	cout <next;
		count++;
	}

	if (p == NULL)
	{
		return;
	}
	else {
		ListNode* newnode = new ListNode;
		newnode->data = data;
		newnode->next = p->next;
		p->next = newnode;
	}


}

void inserbyhead(ListNode* headnode, int data)
{
	ListNode* p = headnode;
	ListNode* newnode = new ListNode;

	newnode->data = data;
	newnode->next = p->next;
	p->next = newnode;
}
int main()
{
	ListNode* head = NULL;
	head = new ListNode;
	head->data = NULL;
	head->next = NULL;

	creatList(head);
	printlist(head);

	insertbyset(head, 2, 100);
	printlist(head);

	inserbyhead(head, 50);
	printlist(head);

	system("pause");
	return 0;
}