STACK DEFINITION CODE

We can throw a stack overflow error if a user tries to exceed this capacity. Here, 10 is a pre-defined capacity of the stack.

ThatвЂ™s why we need to set an index as top and then access only the element at index top. But can we access any element of the stack at any given time? No. Array ImplementationДЄn array is one of the simplest containers offering random access to users based on indexes. We shall be implementing stack in two different ways by changing the underlying container: Array and Linked List. You should remember one very important thing though в†’ All operations in the stack must be of O(1) time complexity

STACK DEFINITION CODE

But can you implement it in your code yet? It's not that difficult once you think about it, letвЂ™s walk through its properties and implement them in code. Stack ImplementationДЄs weвЂ™ve learned before, Stack is a very useful concept that a good programmer could use to his/her benefit. isEmpty() conventionally returns a boolean value: True if size is 0, else False. To prevent performing operations on an empty stack, the programmer is required to internally maintain the size of the stack which will be updated during push and pop operations accordingly.

The stack is not modified in any manner in this operation.

Peek operation allows the user to see the element on the top of the stack. Note: We can also choose to return the value of the popped element back, its completely at the choice of the programmer to implement this. Again, since we only have access to the element at the top of the stack, thereвЂ™s only one element that we can remove. Pop operation refers to the removal of an element. Since thereвЂ™s only one position at which the new element can be insertedвЂЉ-вЂЉTop of the stack, the new element is inserted at the top of the stack. Push operation refers to inserting an element in the stack.

Stack definition