forked from codehouseindia/Everything
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLinkList.cpp
More file actions
139 lines (127 loc) · 1.63 KB
/
LinkList.cpp
File metadata and controls
139 lines (127 loc) · 1.63 KB
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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
#https://www.facebook.com/permalink.php?story_fbid=2038368196299821&id=100003799820060
#Subscribed By Nitin(Kattebaaz)
#include <iostream>
using namespace std;
class Node
{
public:
int data;
Node *next;
};
class LinkedList
{
private:
Node *first;
public:
LinkedList(){first=NULL;}
LinkedList(int A[],int n);
~LinkedList();
void Display();
void Insert(int index,int x);
int Delete(int index);
int Length();
};
LinkedList::LinkedList(int A[],int n)
{
Node *last,*t;
int i=0;
first=new Node;
first->data=A[0];
first->next=NULL;
last=first;
for(i=1;i<n;i++)
{
t=new Node;
t->data=A[i];
t->next=NULL;
last->next=t;
last=t;
}
}
LinkedList::~LinkedList()
{
Node *p=first;
while(first)
{
first=first->next;
delete p;
p=first;
}
}
void LinkedList::Display()
{
Node *p=first;
while(p)
{
cout<<p->data<<" ";
p=p->next;
}
cout<<endl;
}
int LinkedList::Length()
{
Node *p=first;
int len=0;
while(p)
{
len++;
p=p->next;
}
return len;
}
void LinkedList::Insert(int index,int x)
{
Node *t,*p=first;
if(index <0 || index > Length())
return;
t=new Node;
t->data=x;
t->next=NULL;
if(index==0)
{
t->next=first;
first=t;
}
else
{
for(int i=0;i<index-1;i++)
p=p->next;
t->next=p->next;
p->next=t;
}
}
int LinkedList::Delete(int index)
{
Node *p,*q=NULL;
int x=-1;
if(index < 1 || index > Length())
return -1;
if(index==1)
{
p=first;
first=first->next;
x=p->data;
delete p;
}
else
{
p=first;
for(int i=0;i<index-1;i++)
{
q=p;
p=p->next;
}
q->next=p->next;
x=p->data;
delete p;
}
return x;
}
int main()
{
int A[]={1,2,3,4,5};
LinkedList l(A,5);
l.Insert(3,10);
l.Display();
return 0;
}