Reverse a stack using recursion (GFG)

#include <bits/stdc++.h>
using namespace std;

void push_bottom(stack<int> &Stack, int num) {
    if(Stack.empty()) {
        Stack.push(num);
        return;
    }
    int x = Stack.top();
    Stack.pop();
    push_bottom(Stack, num);
    Stack.push(x);
}

void reverseStack(stack<int> &Stack) {
    if(Stack.empty()) return;
    int x = Stack.top();
    Stack.pop();
    reverseStack(Stack);
    push_bottom(Stack, x);
}

int main() {
	// your code goes here
	int n, num;
	cin >> n;
	stack<int> Stack;
	for(int i = 0; i < n; i++) {
	    cin >> num;
    	Stack.push(num);
	}
	reverseStack(Stack);
	for(int i = 0; i < n; i++) {
	    cout << Stack.top() << " ";
	    Stack.pop();
	}
	return 0;
}