-
Notifications
You must be signed in to change notification settings - Fork 170
/
Copy pathSingleEnded.java
161 lines (130 loc) · 2.29 KB
/
SingleEnded.java
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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
class Node {
int data;
Node link;
public Node(int data) {
this.data = data;
this.link = null;
}
}
class SingleEnded {
private Node start;
private int length;
SingleEnded() {
start = null;
length = 0;
}
public void insertBeg(int data) {
Node newNode = new Node(data);
if(start == null) {
start = newNode;
}else {
newNode.link = start;
start = newNode;
}
length++;
}
public void insertEnd(int data) {
Node newNode = new Node(data);
if(start == null) {
start = newNode;
}else {
Node n = start;
while(n.link != null) {
n = n.link;
}
n.link = newNode;
}
length++;
}
public void insetPos(int data, int pos) {
if(pos < 0) {
System.out.println("Pos does not");
return;
}
if(pos == 1) {
insertBeg(data);
} else if( pos > length) {
insertEnd(data);
} else {
int i=1;
Node n = start;
while( n.link != null ) {
i++;
if( i == pos) break;
n = n.link;
}
Node newNode = new Node(data);
newNode.link = n.link;
n.link = newNode;
length++;
}
}
public void deleteBeg() {
if(start == null) {
System.out.println("linkedlist Empty");
} else {
start = start.link;
length--;
}
}
public void deleteEnd() {
if(start == null) {
System.out.println("linkedlist Empty");
} else if(start.link == null) {
start = null;
length = 0;
} else {
Node n = start;
while(n.link.link != null) {
n = n.link;
}
n.link = null;
length--;
}
}
public void deletePos(int pos) {
if(pos < 0) {
System.out.println("Pos does not");
return;
}
if(pos == 1) {
deleteBeg();
} else if( pos > length) {
deleteEnd();
} else {
int i=1;
Node n = start;
while( n.link != null ) {
i++;
if( i == pos) break;
n = n.link;
}
n.link = n.link.link;
length--;
}
}
public void display() {
Node n = start;
while(n != null) {
System.out.print(n.data + " ");
n = n.link;
}
System.out.println();
}
public static void main(String[] args) {
SingleEnded sl = new SingleEnded();
sl.insertBeg(10);
sl.insertBeg(20);
sl.insertBeg(30);
sl.insertEnd(40);
sl.insetPos(60,5);
sl.insetPos(5,5);
sl.display();
sl.deleteBeg();
sl.display();
sl.deleteEnd();
sl.display();
sl.deletePos(2);
sl.display();
}
}