-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSingleLinkedList2.java
More file actions
137 lines (116 loc) · 2.08 KB
/
Copy pathSingleLinkedList2.java
File metadata and controls
137 lines (116 loc) · 2.08 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
public class SingleLinkedList2 {
private Node head;
public SingleLinkedList2()
{
head = null;
}
public void addToEnd(Object dataToAdd)
{
Node newNode = new Node(dataToAdd);
if(head == null)
{
head = newNode;
}
else
{
Node temp = head;
while(temp.getLink() != null)
{
temp = temp.getLink();
}
temp.setLink(newNode);
}
}
public String display()
{
String output = "";
Node temp = head;
while(temp != null)
{
output += temp.getData() + " ";
temp = temp.getLink();
}
return output;
}
public void remove(Object dataToRemove)
{
if(head == null)
{
System.err.println("The Linked List is empty");
}
else
{
while((int)head.getData() == (int)dataToRemove)
{
head = head.getLink();
}
Node temp = head;
Node prev = null;
while(temp != null)
{
if((int)temp.getData() == (int) dataToRemove)
{
prev.setLink(temp.getLink());
temp = temp.getLink();
}
else
{
prev = temp;
temp = temp.getLink();
}
}
}
}
public int size()
{
if(head == null)
{
System.err.println("The Linked List is empty");
return 0;
}
else
{
int counter = 0;
Node temp = head;
while(temp != null)
{
counter++;
temp = temp.getLink();
}
return counter;
}
}
public boolean search(Object dataToSearch)
{
if(head == null)
{
return false;
}
else
{
Node temp = head;
boolean retVal = false;
while(temp != null)
{
if((int)temp.getData() == (int) dataToSearch)
{
retVal = true;
break;
}
temp = temp.getLink();
}
return retVal;
}
}
public int book(int value) {
int bookCount = 0;
Node temp = head;
while(temp != null) {
if((int)temp.getData() == value) {
bookCount++;
}
temp = temp.getLink();
}
return bookCount;
}
}