Stacks on Data Structure and Algorithms related Questions and Answers

Question :   The time complexity of converting a prefix notation to infix notation is _________ 1. O(n) where n is the length of the equation 2. O(n) where n is number of operands 3. O(1) 4. O(logn) where n is length of the equation Answer :   1 - O(n) where n is the length of the equation