Solution Review: Reverse a Stack

import stack as s
 
def insertAtBottom(stack, item) : # Recursive function that inserts an element at the bottom of a stack.
  # Base case
  if s.isEmpty(stack) :
    s.push(stack, item)
  # Recursive case
  else:
    temp = s.pop(stack)
    insertAtBottom(stack, item)
    s.push(stack, temp) 
def reverse(testVariable) :
  # Recursive case
  if not s.isEmpty(testVariable) :
    temp = s.pop(testVariable)
    reverse(testVariable)
    insertAtBottom(testVariable, temp) 
# Driver Code 
myStack = s.createStack() 
s.push(myStack, str(8)) 
s.push(myStack, str(5)) 
s.push(myStack, str(3)) 
s.push(myStack, str(2)) 
print("Original Stack") 
s.printStack(myStack) 
reverse(myStack) 
print("\n\nReversed Stack") 
s.printStack(myStack)