-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDoubleNode.java
90 lines (63 loc) · 1.12 KB
/
DoubleNode.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
/**
* @author Cameron Maxwell
* represents the nodes in a doubly linked list
* @param <T>
*/
public class DoubleNode<T> {
// A reference to the next node in the list.
private DoubleNode<T> next;
// A reference to the previous node in the list.
private DoubleNode<T> prev;
// the data stored in the node
private T data;
public DoubleNode () {
// set next, prev, and data to null
next = null;
prev = null;
data = null;
}
/**
* @param newData
*/
public DoubleNode (T newData) {
data = newData;
next = null;
prev = null;
}
/**
* @return next
*/
public DoubleNode<T> getNext() {
return next;
}
/**
* @return prev
*/
public DoubleNode<T> getPrev() {
return prev;
}
/**
* @return data
*/
public T getData() {
return data;
}
/**
* @param nextNode
*/
public void setNext(DoubleNode<T> nextNode) {
next = nextNode;
}
/**
* @param prevNode
*/
public void setPrev(DoubleNode<T> prevNode) {
prev = prevNode;
}
/**
* @param newData
*/
public void setData(T newData) {
data = newData;
}
} // class closes