Register

Infix to postfix time complexity

1,063 views
0 votes
0 votes
Sir it is given everywhere that time complexity of infix to postfix is O(1) but according to algorithm for some operators we have to traverse back the stack until we find a operator with less precedence than this so is it always O(1 ) even if we do amortized analysis
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

894
views
0 answers
0 votes
Mk Utkarsh asked Oct 20, 2018
894 views
Infix to postfix (Complicated declarations)
Please convert it to postfix by using stack and explain in detailvoid (*bsd_signal(int sig, void (*func)(int)))(int);
User Avatar
390
views
1 answers
2 votes
sumit goyal 1 asked Jul 31, 2017
390 views
infix to postfix doubt
if i get A + [ (B+C) ] /G in infix and i want to convert it into postfix then what to do with sign [ should i push it into stack ??
User Avatar
525
views
2 answers
2 votes
sumit goyal 1 asked Jul 31, 2017
525 views
infix to postfix doubt
A * B ^ C + D becomes A B C ^ * D +Here both the exponentiation and the multiplication must be done before the addition.current symboloperator stackpostfix ... be popped out , i checked precedence table too , someone explain this thanks
User Avatar
5.7k
views
1 answers
2 votes
Himanshu Goyal asked Jul 14, 2017
5,670 views
Infix to postfix stack size
How is ans 15 for this question Please can anybody solve this
User Avatar
Link Copied!