#include <iostream>
using namespace Std;
Class node//Node
{
Public
int data;
Node* Next;
Public
Node ():d ata (0), next (NULL) {}
};
Class list//Linked list
{
Public
List (): Headnode (null), Lastnode (null), node (null), length (0) {}//Create linked list, initialize list
void Add (int x);//Add a node
BOOL IsEmpty () const;//determine if the linked list is empty
void Travle () const;//traverse this list
Private
node* headnode;//head Node
node* lastnode;//Tail Node
node* node;//Temporary node
int length;//Linked list length
};
void List::travle () const
{
node* temp = Headnode;
while (Temp!=null)
{
cout << temp->data<< "";
temp = temp->next;
}
Return
}
void List::add (int x)
{
node = new node ();
Node->data = x;
if (lastnode==null)
{
lastnode = node;
Headnode = node;
}
Lastnode->next = node;
lastnode = node;
length++;//chain list length plus 1
}
BOOL List::isempty () const
{
return lastnode = = NULL;
}
int main ()
{
List A;
A.add (1);
A.add (3);
A.add (5);
A.add (7);
A.travle ();
int b;
return 0;
}
Unidirectional Link List 2