include iostream struct node int data node next node int data next NUL

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include <iostream>
struct node {
int data;
node *next;
node(int d):
data(d), next(NULL)
{}
};
class List {
public:
List():
head(NULL), last(NULL), count(0)
{}
~List()
{
clear();
}
void clear()
{}
node *push_back(int data)
{
node *temp = new node(data);
if( empty() )
head = temp;
else
last->next = temp;
last = temp;
count++;
return temp;
}
node *push_front(int data)
{
node *temp = new node(data);
if( empty() )
last = temp;
else
temp->next = head;
head = temp;
count++;
return temp;
}
inline bool empty()
{ return count==0; }
inline node *begin()
{ return head; }
protected:
node *head;
node *last;
int count;
};
int main()
{
int i;
List l;
for( i=0 ; i<10 ; i++ )
l.push_back(i);
for( i=0 ; i<10 ; i++ )
l.push_front(i);
node *iter = l.begin();
while( iter!=NULL )
{
std::cout << iter->data << ' ';
iter = iter->next;
}
std::cout << std::endl;
return 0;
}