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
|
#include<iostream>
using namespace std;
struct node
{
node* next;
int data;
};
void insert(int item,node* head,node* last)
{
static node* temp = NULL;
if (head == NULL)
{
temp = new node;
temp->data = item;
temp->next = NULL;
head = temp;
last = temp;
}
else
{
temp = new node;
temp->data = item;
temp->next = NULL;
last->next = temp;
last = temp;
}
}
void display(node* head)
{
if (head == NULL)
cout << "\nList is Empty\n";
else
{
while (head != NULL)
{
cout << head->data << " ";
head = head->next;
}
}
}
int main()
{
static node* head = NULL;
static node* last = NULL;
insert(1, head, last);
insert(1, head, last);
insert(1, head, last);
insert(1, head, last);
insert(1, head, last);
insert(1, head, last);
insert(1, head, last);
display(head);
system("pause");
}
|