Register

Infix to postfix stack size

5,505 views

1 Answer

Best answer
1 votes
1 votes

The question asked is incomplete, they should ask "what is the sum of different height that stack should have while infix to postfix conversion."

The resultant postfix will be: - PQ+RS+*T/ABC+*+

and the different height will be ,2,3,4,5;

sum is 1 + 2 + 3 + 4 + 5 = 15.

Ans = 15

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
Mk Utkarsh asked Oct 20, 2018
847 views
Infix to postfix (Complicated declarations)
Please convert it to postfix by using stack and explain in detail void (*bsd_signal(int sig, void (*func)(int)))(int);
Please convert it to postfix by using stack and explain in detailvoid (*bsd_signal(int sig, void (*func)(int)))(int);
User Avatar
2 votes
2 votes
2 answers
2
Amit puri asked Sep 29, 2016
2,728 views
Infix to postfix
Convert the infix to postfix and prefix expression 1) log3! ^log4 *log log 6/7*4! 2)log3!^sin 2*cos 3
Convert the infix to postfix and prefix expression1) log3! ^log4 *log log 6/7*4!2)log3!^sin 2*cos 3
User Avatar
2 votes
2 votes
3 answers
3
Tushar Shinde asked Jan 28, 2016
3,687 views
MadeEasy Test Series: Programming & DS - Infix Postfix
Consider the following expression with infix notation A * B - (C + D) * (E / 5) ^ F What is the maximum height of the operator stack during conversion from infix to postfix ? a) 3 b) 4 c) 5 d) 6
Consider the following expression with infix notationA * B - (C + D) * (E / 5) ^ F What is the maximum height of the operator stack during conversion from infix to postfi...
User Avatar
Link Copied!