Stacks on Data Structure and Algorithms related Questions and Answers


Question :   What is the time complexity of an infix to postfix conversion algorithm?
1. O(N log N)
2. O(N)
3. O(N2)
4. O(M log N)
Answer :   2 - O(N)  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter