Question

Problem 2: Write a program in C or C++ that takes a number series of size n (n integers) as input from the user, push all the numbers to the stack, and reverse the stack using recursion. Please note that this is not simply popping and printing the numbers, but the program should manipulate the stack to have the numbers stored in reverse order. In addition to the provided header file, the students can use the following function to print the content of the stack:

void printStack(STACK* stack)

{

int n=stackCount(stack); if(n==0)

{

printf("Stack is empty");

return; }

STACK_NODE* temp;

temp = stack->top;

int ary[n];

printf("Printing Stack contents (from bottom to top):\n"); for(int i=0;i<n;i++)

{

int* data = (int*)temp->dataPtr; ary[i]=*data;

temp=temp->link;

}

for(int i=n-1;i>=0;i--)

printf("%d ",ary[i]); printf("\n");

}

Answer 1

char insert_at_bottom(Stack *stack1, int x) {
if(stack1.size() == 0)
stack1.push(x);
else {
// All items are held in Stack until we reach end of the stack When the stack becomes empty, the stack1.size() becomes 0, the above if part is executed and the item is inserted at the bottom.
int a = stack1.top();
stack1.pop();
insert_at_bottom(x);
// push all the items held in current Stack once the item is inserted at the bottom.
stack1.push(a);
}
}

char reverse(Stack *stack1) {
if(stack1.size()>0) {
// Hold all items in Stack until we have reached the end of the stack.
int x = stack1.top();
stack1.pop();
reverse();
// Insert all the items held in Stack one by one from the bottom to top.
insert_at_bottom(x);
}
}

The above two functions can help in reversing the stack. Reverse() is the recursive function that we need.

Hope this helps. If you have any queries or suggestions regarding the answers please leave them in the comments section so I can update and improve the answer. Thank you.