Data Structures and AlgorithmsTU Board 2079
How recursive algorithm uses stack to store intermediate results? Illustrate with an example. Convert the infix expression A+B (C D/E+F) G H into postfix expression using stack.
10A worked answer is on its wayMeanwhile, read the Data Structures and Algorithms notes for this topic.
Discussion
Loading…
More Data Structures and Algorithms questions
Define circular queue. How queue differ from stack. Write a program to implement linear queue.TU Board 208110What is AVL tree? How heap differ from tree? Construct an AVL tree for data 24,12,8,15,35,30,57,40,45 and 78.TU Board 208110Define list. How can you use linked list to implement stack? Explain circular linked list.TU Board 208110Explain big oh notation in brief. Find big oh of the following function: f(x) = 5x^4 + 9x^2 + 7x + 9.TU Board 20815Convert the infix expression A+(((B C) (D E)+F)/G)$(H I) into post expression using stack.TU Board 20815Write a program to find GCD of two numbers using recursion.TU Board 20815