Implementation of stack using recursion

Answer 1

public void reverse(Stack st)

{

int m = (int)st.Pop();

if (st.Count != 1)

reverse(st);

Push(st , m);

}

public void Push(Stack st , int a)

{

int m = (int)st.Pop();

if (st.Count != 0)

Push(st , a);

else

st.Push(a);

st.Push(m);

}

Answer 2

Hi,

The basic idea implementing the stack using recursive function calling is simple. while calling a function in c++ the function parameters are being push on to the internal stack.

So we will use this same concept and I'll show you how we can achieve this stack functionality using recursive function call in C++.

int n=0;

int arr[4]={1,2,3,4};

int stack(int a)

{

if(n<4)

{

n++;

cout<

}

return a;

}

int main() { stack(arr[0]);

}

Here, I'm passing the elements of stack to the function 'stack' and returning the same value from the function. Means the last value we 'push' onto the stack will come first from the stack using 'return a'.

The array input is 1,2,3,4 and output will be 4,3,2,1 which is exactly LIFO which is the primary goal of stack.

Feel free to contact me on ashisht4u@rediffmail.com if you need any other clarification on the same.