Register
Filter

Questions by Radha mohan

0 votes
0 answers
1
Infix to postfix time complexity
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
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...