More Problems

• Implement a stack to evaluate a postfix expression.
• Write a program to sort a stack using recursion.
• Design a function to convert an infix expression to a postfix expression using a stack.
• Implement a stack to simulate a queue (queue using two stacks).
• Write a program to check if a string has balanced parentheses using a stack.
• Design a stack that supports getMin() in constant time without using additional stacks.
• Implement a function to reverse a stack using recursion without using any additional stack.
• Write a program to sort a stack such that the smallest elements are on the top.