Repository navigation
Expand file tree
/
Copy pathstack.js
More file actions
70 lines (59 loc) · 1.61 KB
/
Copy pathstack.js
File metadata and controls
70 lines (59 loc) · 1.61 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
/* Part of Cosmos by OpenGenus Foundation */
/* Stack!!
* A stack is exactly what it sounds like. An element gets added to the top of
* the stack and only the element on the top may be removed. This is an example
* of an array implementation of a Stack. So an element can only be added/removed
* from the end of the array.
*/
// Functions: push, pop, peek, view, length
//Creates a stack
var Stack = function() {
//The top of the Stack
this.top = 0;
//The array representation of the stack
this.stack = {};
//Adds a value onto the end of the stack
this.push = function(value) {
this.stack[this.top] = value;
this.top++;
};
//Removes and returns the value at the end of the stack
this.pop = function() {
if (this.top === 0) {
return "Stack is Empty";
}
this.top--;
var result = this.stack[this.top];
delete this.stack[this.top];
return result;
};
//Returns the size of the stack
this.size = function() {
return this.top;
};
//Returns the value at the end of the stack
this.peek = function() {
return this.stack[this.top - 1];
};
//To see all the elements in the stack
this.view = function() {
for (var i = 0; i < this.top; i++) console.log(this.stack[i]);
};
};
//Implementation
var myStack = new Stack();
myStack.push(1);
myStack.push(5);
myStack.push(76);
myStack.push(69);
myStack.push(32);
myStack.push(54);
console.log(myStack.size());
console.log(myStack.peek());
console.log(myStack.pop());
console.log(myStack.peek());
console.log(myStack.pop());
console.log(myStack.peek());
myStack.push(55);
console.log(myStack.peek());
myStack.view();