链表基础
#include<iostream>
using namespace std;
class Node
{
public: int data;
public: Node* next;
Node()
{
data=0;
next=NULL;
}
};
int main()
{
Node* pHead;
Node* pRear;
Node* pNew;
for(int i=0;i<5;i++)
{
pNew= new Node;
pNew->data=i;
if(i==0)
pRear=pHead=pNew;
else
{
pRear->next=pNew;
}
pNew->next=NULL;
pRear=pNew;
}
Node* tmp=pHead;
while(tmp!=NULL)
{
cout<<tmp->data;
tmp=tmp->next;
}
return 0;
}