Create a data structure twoStacks that represents two stacks. Implementation of twoStacks should use only one array, i.e., both stacks should use the same array for storing elements. Following functions must be supported by twoStacks.
push1(int x) –> pushes x to first stack
push2(int x) –> pushes x to second stack
pop1() –> pops an element from first stack and return the popped element
pop2() –> pops an element from second stack and return the popped element
Implementation of twoStack should be space efficient.
Method 1 (Divide the space in two halves)
A simple way to implement two stacks is to divide the array in two halves and assign the half half space to two stacks, i.e., use arr to arr[n/2] for stack1, and arr[(n/2) + 1] to arr[n-1] for stack2 where arr is the array to be used to implement two stacks and size of array be n.
The problem with this method is inefficient use of array space. A stack push operation may result in stack overflow even if there is space available in arr. For example, say the array size is 6 and we push 3 elements to stack1 and do not push anything to second stack2. When we push 4th element to stack1, there will be overflow even if we have space for 3 more elements in array.
Method 2 (A space efficient implementation)
This method efficiently utilizes the available space. It doesn’t cause an overflow if there is space available in arr. The idea is to start two stacks from two extreme corners of arr. stack1 starts from the leftmost element, the first element in stack1 is pushed at index 0. The stack2 starts from the rightmost corner, the first element in stack2 is pushed at index (n-1). Both stacks grow (or shrink) in opposite direction. To check for overflow, all we need to check is for space between top elements of both stacks. This check is highlighted in the below code.
Popped element from stack1 is 11 Popped element from stack2 is 40
Time complexity of all 4 operations of twoStack is O(1).
We will extend to 3 stacks in an array in a separate post.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- How to efficiently implement k stacks in a single array?
- Sorting array using Stacks
- How to efficiently implement k Queues in a single array?
- Queue using Stacks
- Bubble sort using two Stacks
- GATE CS 2016 Sec 4 – Stacks
- Find maximum sum possible equal sum of three stacks
- Infix to Prefix conversion using two stacks
- Sudo Placement[1.3] | Playing with Stacks
- Merging and Sorting Two Unsorted Stacks
- Iterative Postorder Traversal | Set 1 (Using Two Stacks)
- How to implement Min Heap using STL?
- Implement Your Own sizeof
- Implement your own itoa()
- Program to implement t-test
Improved By : siddhartha33