Vidyalelo
Data Structure · Q71

Stacks in Data Structures

Programming · Data Structure · question 71

Q71

The time complexity of converting a prefix notation to infix notation is . . . . . . . .

A.
O(n) where n is the length of the equation
Answer
B.
O(n) where n is number of operands
C.
O(1)
D.
O(logn) where n is length of the equation

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board