MCQOPTIONS
Saved Bookmarks
| 1. |
What is the time complexity of evaluation of postfix expression algorithm? |
| A. | O (N) |
| B. | O (N log N) |
| C. | O (N2) |
| D. | O (M log N) |
| Answer» B. O (N log N) | |