InterviewSolution
Saved Bookmarks
| 1. |
What is the time complexity of evaluation of postfix expression algorithm?(a) O (N)(b) O (N log N)(c) O (N^2)(d) O (M log N)Origin of the question is Application of Stacks in portion Application of Stacks of Data Structures & Algorithms IThe question was asked in homework. |
|
Answer» Correct CHOICE is (a) O (N) |
|