Question 3.23 A and b part c++ program

cs210 textbook.pdf x C Data Structures And Algorit + V - X a Assignment 0 E 0 file:///C:/Users/ksimr/Desktop/cs210%20textbook.pdf Exercises 119 3.22 Write a program to evaluate a postfix expression. 3.23 a. Write a program to convert an infix expression that includes (,), +, -, *, and / to postfix. b. Add the exponentiation operator to your repertoire. c. Write a program to convert a postfix expression to infix. 3.24 Write routines to implement two stacks using only one array. Your stack routines should not declare an overflow unless every slot in the array is used. 3.25 *a. Propose a data structure that supports the stack push and pop operations and a third operation findMin, which returns the smallest element in the data structure, all in O(1) worst-case time. * b. Prove that if we add the fourth operation deleteMin which finds and removes the smallest element, then at least one of the operations must take 2 (log N) time. (This requires reading Chapter 7.) *3.26 Show how to implement three stacks in one array. 3.27 If the recursive routine in Section 2.4 used to compute Fibonacci numbers is run for N = 50, is stack space likely to run out? Why or why not? 3.28 Adeque is a data structure consisting of a list of items on which the following operations are possible: A a ) ENG 8:41 PM |