C++ :: Recursion To Loop Using Stack

I want to convert the following program into a non-recursive code using a stack and a loop:

void write(int n) {
if (n>0) {
write(n-1);
cout << n << " ";
write(n-1);
}
}

And here is the code I am using but that currently does not work, and I do not know why:

stack<int> S;
S.push(n);
while (not S.empty()) {
int k = S.top();

[Code] .....

How to simulate that recursion. I thought it was enough to push into the stack the equivalent recursive call.