How to Reverse a Stack Using Recursion in Python

Submitted by razormist on Sunday, December 14, 2025 - 23:44.

In this tutorial, we will learn how to program "How to Reverse a Stack Using Recursion in Python." The objective is to reverse a stack using recursion. This tutorial will guide you step by step through methods for reversing the stack. By the end of this tutorial, you will have a solid understanding of how to implement this task effectively in Python, helping you strengthen your problem-solving abilities and improve your coding skills.

This topic is straightforward and easy to understand. Simply follow the instructions provided, and you will complete it with ease. The program will guide you step by step through the process of reversing the stack list. So, let's dive into the coding process!

Getting Started:

First you will have to download & install the Python IDLE's, here's the link for the Integrated Development And Learning Environment for Python https://www.python.org/downloads/.

Creating Main Function

This is the main function of the application. The following code will display a simple GUI in terminal console that will display program. To do this, simply copy and paste these blocks of code into the IDLE text editor.

class Stack:
    def __init__(self):
        self.items = []
 
    def is_empty(self):
        return self.items == []
 
    def push(self, data):
        self.items.append(data)
 
    def pop(self):
        return self.items.pop()
 
    def display(self):
        for data in reversed(self.items):
            print(data)
 
 
def insert_at_bottom(s, data):
    if s.is_empty():
        s.push(data)
    else:
        popped = s.pop()
        insert_at_bottom(s, data)
        s.push(popped)
 
 
def reverse_stack(s):
    if not s.is_empty():
        popped = s.pop()
        reverse_stack(s)
        insert_at_bottom(s, popped)
 
 
while True:
    print("\n================== Reverse a Stack Using Recursion ==================\n")
 
    s = Stack()
    data_list = input("Please enter the elements to push: ").split()
 
    for data in data_list:
        s.push(int(data))
 
    print("\nThe stack:")
    s.display()
 
    reverse_stack(s)
 
    print("\nAfter reversing:")
    s.display()
 
    opt = input("\nDo you want to try again? (yes/no): ").strip().lower()
    if opt == 'no':
        print("Exiting program...")
        break
    elif opt != 'yes':
        print("Invalid choice. Exiting program...")
        break

This program reverses a stack using recursion without using any extra data structures. The user inputs elements to create a stack, which is displayed in its original order. The program then uses two recursive functions—`reverse_stack` and `insert_at_bottom`—to reverse the stack by temporarily removing elements and reinserting them at the bottom. After reversal, the updated stack is displayed. The program allows the user to repeat the process or exit.

Output:

There you have it we successfully created How to Reverse a Stack Using Recursion in Python. I hope that this simple tutorial help you to what you are looking for. For more updates and tutorials just kindly visit this site. Enjoy Coding!

More Tutorials for Python Language

Python Tutorials