forked from Harshita-Kanal/Data-Structures-and-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
stack_design.cpp
61 lines (49 loc) · 949 Bytes
/
stack_design.cpp
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
#include <bits/stdc++.h>
using namespace std;
stack<int>_push(int arr[],int n);
void _pop(stack<int>s);
// } Driver Code Ends
//User function Template for C++
/* _push function to insert elements of array to
stack
*/
stack<int>_push(int arr[],int n)
{
long int i;
stack<int> st;
for(i = 0; i < n; i++){
st.push(arr[i]);
}
return st;
//return a stack with all elements of arr inserted in it
}
/* _pop function to print elements of the stack
remove as well
*/
void _pop(stack<int>s)
{
while(!s.empty()){
long int x = s.top();
cout << x << " ";
s.pop();
}
//print top and pop
//for each element until it becomes empty
}
int main() {
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
stack<int>mys=_push(arr,n);
_pop(mys);
cout<<endl;
}
return 0;
}
// } Driver Code Ends