In conversion from prefix to postfix using stack data-structure, if operators and operands are pushed and popped exactly once, then the run-time complexity is ............
A. Ο(1)
B. Ο(n)
C. Ο(log n)
D. Ο(n2)
Answer:B
In conversion from prefix to postfix using stack data-structure, if operators and operands are pushed and popped exactly once, then the run-time complexity is ............
A. Ο(1) B. Ο(n) C. Ο(log n) D. Ο(n2)