-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathDoublyLinkedListImpl.java
More file actions
219 lines (176 loc) · 4.56 KB
/
DoublyLinkedListImpl.java
File metadata and controls
219 lines (176 loc) · 4.56 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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
public class DoublyLinkedListImpl<E> implements CollectionInterface<E>
{
private LinkEntry<E> head;
private LinkEntry<E> tail;
private int s = 1;
public DoublyLinkedListImpl()
{
head = tail = null;
}
public boolean is_empty()
{
if (head == null)
return true;
return false;
}
public boolean is_full() { return false; }
public int size()
{
return size_r(head) - 1;
}
public boolean add(int index, E e)
{
throw new UnsupportedOperationException();
}
/*
* Add e to the end of the doubly linked list.
* Returns true - if e was successfully added, false otherwise.
*/
public boolean add(E e)
{
LinkEntry<E> temp = new LinkEntry<E>();
temp.element=e;
if ( is_empty()){
head=temp;
tail=temp;
} else {
tail.next=temp;
temp.previous=tail;
tail=temp;
}
return true;
}
public boolean addToFront(E e)
{
LinkEntry<E> temp = new LinkEntry<E>();
temp.element=e;
if ( is_empty()){
head=temp;
tail=temp;
} else {
head.previous=temp;
temp.next=head;
head=temp;
}
return true;
}
/*
* Remove the nth element in the list. The first element is element 1.
* Return the removed element to the caller.
*/
public E remove(int n)
{
LinkEntry<E> temp = new LinkEntry<E>();
temp=head;
for(int i=0;i<n;i++) {
temp = temp.next;
if (temp == null)
return null;
}
if (temp == head){
head = head.next;
}else{
temp.previous.next = temp.next;
}
if (temp == tail){
tail = temp.previous;
}else{
temp.next.previous = temp.previous;
}
return temp.element;
}
/*
* Print the doubly linked list starting at the beginning.
*/
public void print_from_beginning()
{
LinkEntry<E> temp = new LinkEntry<E>();
temp=head;
while(temp!=null){
System.out.println(temp.element);
temp=temp.next;
}
}
/*
* Print the doubly linked list starting the end.
*/
public void print_from_end()
{
LinkEntry<E> temp = new LinkEntry<E>();
temp=tail;
while(temp!=null){
System.out.println(temp.element);
temp=temp.previous;
}
}
/*
* Does the linked list contain element e?
*/
public boolean contains(E e)
{
LinkEntry<E> check = new LinkEntry<E>();
check=head;
while(check != null){
if(check.element.equals(e))
return true;
check = check.next;
}
return false;
}
public E remove()
{
throw new UnsupportedOperationException();
}
public E get(int index)
{
throw new UnsupportedOperationException();
}
private int size_r(LinkEntry<E> head)
{
if (head != null)
s = s + size_r(head.next);
return s;
}
/* ------------------------------------------------------------------- */
/* Inner classes */
protected class LinkEntry<E>
{
protected E element;
protected LinkEntry<E> next;
protected LinkEntry<E> previous;
protected LinkEntry() { element = null; next = previous = null; }
}
public static void main(String[] args){
DoublyLinkedListImpl<String> doublyList = new DoublyLinkedListImpl<>();
doublyList.add("Bill");
doublyList.add("Rohan");
doublyList.add("James");
doublyList.addToFront("Krishna");
doublyList.add("Javier");
doublyList.add("Lisa");
System.out.println("Printing Forward");
doublyList.print_from_beginning();
System.out.println("");
System.out.println("Printing Backward");
doublyList.print_from_end();
System.out.println("");
System.out.println("removing Bill and printing forward");
doublyList.remove(0);
System.out.println("");
doublyList.print_from_beginning();
System.out.println("");
System.out.println("removing Lisa and printing backward");
doublyList.remove(4);
System.out.println("");
doublyList.print_from_end();
System.out.println("");
System.out.println("removing Krishna and printing forward");
doublyList.remove(2);
System.out.println("");
doublyList.print_from_beginning();
System.out.println("");
System.out.println("Checking James on list: "+doublyList.contains("James"));
System.out.println("");
System.out.println("Checking Etta on list: "+doublyList.contains("Etta"));
}
} /* CS401LinkedListImpl<E> */