-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCustomStack.java
More file actions
137 lines (119 loc) · 2.72 KB
/
CustomStack.java
File metadata and controls
137 lines (119 loc) · 2.72 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
package myStack;
import java.util.Objects;
public class CustomStack<Item> implements Iterable<Item> {
private Node head;
private int size;
/*
* Constructor
*/
public CustomStack() {
head = null;
size = 0;
}
/*
* To check is stack empty
*/
public boolean isEmpty() {
return (size == 0);
}
/*
* To pop / delete item
*/
public Item pop() {
Item item = (Item) head.item;
head = head.next;
size--;
return item;
}
/*
* To check whether item is present in stack
*/
public boolean contains(Item item){
boolean checker=false;
if(head==null)
System.out.println("Stack is Empty");
Node<Item> temp= head;
while(temp!=null){
if(Objects.equals(temp.item,item)){
checker=true;
break;
}
temp=temp.next;
}
return checker;
}
/*
* To push / add item
*/
public void push(Item item) {
Node oldHead = head;
head = new Node();
head.item = item;
head.next = oldHead;
size++;
}
/*
* To get size
*/
public int size() {
return size;
}
/*
* To get element presnet on top /peeked element
*/
public Item peek(){
return (Item)head.item;
}
private myStack.Node<Item> getNodeAt(int index) {
myStack.Node temp = head;
for (int i = 0; i < index; i++) {
temp = temp.next;
}
return temp;
}
/*
* To reverse stack
*/
public void reverse() {
int li = 0;
int ri = size - 1;
while (li < ri) {
myStack.Node<Item> left = getNodeAt(li);
myStack.Node<Item> right = getNodeAt(ri);
Item temp = left.item;
left.item = right.item;
right.item = temp;
li++;
ri--;
}
}
/*
* To traverse stack
*/
public void traverse() {
myStack.Node<Item> temp = head;
while (temp != null) {
System.out.print(temp.item + " ");
temp = temp.next;
}
System.out.println();
}
/*
* To get centered item in stack
*/
public Item center() {
myStack.Node<Item> slow = head;
myStack.Node<Item> fast = head;
while (fast.next != null && fast.next.next != null) {
slow = slow.next;
fast = fast.next.next;
}
return slow.item;
}
Node<Item> getHead() {
return head;
}
public StackIterator<Item> iterator() {
return new StackIterator<Item>(this);
}
}