C++实现单链表(Singly-Linked List)追加、遍历、删除

<pre name="code" class="cpp">#include <iostream>
using namespace std;

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

class List
{
	Node* head;
public:
	List() { head = NULL;}
	void Print();
	int GetSize();
	void Append(int addData);
	void EraseOne(int eraseData);
	void EraseOne_V2(int eraseData);
};

void List::Print()
{
	Node* tmp = head;

	//list is empty
	if (tmp == NULL)
	{
		cout << "Empty List!\n";
		return;
	}

	//list is not empty
	for(; tmp != NULL; tmp = tmp->next)
	{
		cout << tmp->data << " --> ";
	}
	cout << "NULL\n";
}

int List::GetSize()
{
	Node* tmp = head;

	//list is empty
	if(tmp == NULL)
	{
		return 0;
	}

	//list is not empty
	int num(0);
	for(; tmp != NULL; tmp = tmp->next)
	{
		++num;
	}
	return num;
}

void List::Append(int addData)
{
	//create a new node
	Node* newNode = new N