Repository navigation
Expand file tree
/
Copy pathReverseStackUsingRecursion.java
More file actions
70 lines (53 loc) · 1.74 KB
/
Copy pathReverseStackUsingRecursion.java
File metadata and controls
70 lines (53 loc) · 1.74 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
/* 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);
}
}
}