单向链表的算法实现-单链表的遍历
void LinkPrint(LinkList*& L)
{
LinkNode* p;
p = L->next;
while (p)
{
cout << p->data << "\t";
p = p->next;
}
cout << endl;
}void LinkPrint(LinkList*& L)
{
LinkNode* p;
p = L->next;
while (p)
{
cout << p->data << "\t";
p = p->next;
}
cout << endl;
}