-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLinkedStack.java
More file actions
59 lines (50 loc) · 982 Bytes
/
LinkedStack.java
File metadata and controls
59 lines (50 loc) · 982 Bytes
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
public class LinkedStack<T> implements GenericStack<T> {
private Node top;
private int cur_size;
public LinkedStack() {
this.top = null;
this.cur_size = 0;
}
public void push(T element) throws Exception {
Node node = new Node(element, null);
if (isEmpty()) {
top = node;
} else {
node.setNext(top);
top = node;
}
cur_size++;
}
public T pop() throws Exception {
if (isEmpty())
throw new Exception("Empty stack");
T removed = (T) top.getData();
top = top.getNext();
cur_size--;
return removed;
}
public T top() throws Exception {
if (isEmpty())
return null;
return (T) top.getData();
}
public T get(int pos) {
Node curr = top;
for (int i = 0; i < cur_size; i++) {
if (i == pos)
return (T) curr.getData();
curr = curr.getNext();
}
return null;
}
public void clear() {
top = null;
cur_size = 0;
}
public boolean isEmpty() {
return top == null;
}
public int getSize() {
return cur_size;
}
}