-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStackUsingArray.java
More file actions
61 lines (52 loc) · 1.23 KB
/
Copy pathStackUsingArray.java
File metadata and controls
61 lines (52 loc) · 1.23 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
package stackarray.src.stackusingarray;
class Stack {
static int MAX = 5;
int top;
int a[] = new int[MAX]; // Maximum size of Stack
boolean isEmpty() {
return (top < 0);
}
Stack() {
top = -1;
}
boolean push(int x) {
if (top >= (MAX - 1)) {
System.out.println("Overflow condition reached");
return false;
} else {
a[++top] = x;
System.out.println(x + " pushed into stack");
return true;
}
}
int pop() {
if (top < 0) {
System.out.println("Underflow condition reached");
return 0;
} else {
int x = a[top--];
return x;
}
}
int peek() {
if (top < 0) {
System.out.println("Underflow condition");
return 0;
} else {
int x = a[top];
return x;
}
}
}
public class StackUsingArray {
public static void main(String[] args) {
Stack stk = new Stack();
stk.push(20);
stk.push(40);
stk.push(60);
stk.push(30);
stk.push(20);
stk.push(210);
System.out.println("element popped out : " + stk.pop());
}
}