Skip to content

Added algorithm to reverse a stack #118

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Oct 1, 2017
Merged

Added algorithm to reverse a stack #118

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
dad4c69
Added algorithm to reverse a stack using recursion
nimit17 Oct 1, 2017
727769c
Added algorithm to reverse a stack using recursion
nimit17 Oct 1, 2017
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
74 changes: 74 additions & 0 deletions Misc/ReverseStackUsingRecursion.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,74 @@
/* Program to reverse a Stack using Recursion*/


import java.util.Stack;

public class ReverseStackUsingRecursion {

//Stack
private static Stack<Integer> stack=new Stack<>();

//Main function
public static void main(String[] args) {
//To Create a Dummy Stack containing integers from 0-9
for(int i=0;i<10;i++)
{
stack.push(i);
}
System.out.println("STACK");

//To print that dummy Stack
for(int k=9;k>=0;k--)
{
System.out.println(k);
}

//Reverse Function called
reverseUsingRecursion(stack);

System.out.println("REVERSED STACK : ");
//To print reversed stack
while (!stack.isEmpty())
{
System.out.println(stack.pop());
}


}

//Function Used to reverse Stack Using Recursion
private static void reverseUsingRecursion(Stack<Integer> stack) {
if(stack.isEmpty()) // If stack is empty then return
{
return;
}
/* All items are stored in call stack until we reach the end*/

int temptop=stack.peek();
stack.pop();
reverseUsingRecursion(stack); //Recursion call
insertAtEnd(temptop); // Insert items held in call stack one by one into stack
}

//Function used to insert element at the end of stack
private static void insertAtEnd(int temptop) {
if(stack.isEmpty())
{
stack.push(temptop); // If stack is empty push the element
}
else {
int temp = stack.peek(); /* All the items are stored in call stack until we reach end*/
stack.pop();

insertAtEnd(temptop); //Recursive call

stack.push(temp);
}

}





}