Question

We have a stack. The stack is maintaining the ascending order always. Now, you would need to insert a new value into this stack using a pushStack(in value) function. Write the pushStack() function so that the function always maintains the ascending order in the stack. You can use one additional stack.

In C++

Answer 1

Answer:

C++ program to perform push stack data structure

Explanation:

1. #include <bits/stdc++.h>
4. using namespace std;
6. #define MAX 1000
9. class Stack {
11. int top;
14. public:
16. int a[MAX]; // Maximum size of Stack
19. Stack() { top = -1; }
21. bool push(int x);
23. int pop();
25. int peek();
27. bool isEmpty();
28. };
31. bool Stack::push(int x)
32. {
34. if (top >= (MAX - 1)) {
36. cout << "Stack Overflow";
38. return false;
40. }
42. else {
44. a[++top] = x;
46. cout << x << " pushed into stack\n";
48. return true;
50. }
51. }
53. int main()
54. {
56. class Stack s;
58. s.push(10);
60. s.push(20);
62. s.push(30);
65. return 0;
66. }