McqMate

Q. |
## What is the time complexity of an infix to postfix conversion algorithm? |

A. | O(N log N) |

B. | O(N) |

C. | O(N2) |

D. | O(M log N) |

Answer» B. O(N) |

3.2k

0

Do you find this helpful?

31

View all MCQs in

Data Structures (DS)No comments yet

- Which of the following statement is incorrect with respect to infix to postfix conversion algorithm?
- In infix to postfix conversion algorithm, the operators are associated from?
- Which data structure is needed to convert infix notation to postfix notation?
- Which of the following data structure is required to convert arithmetic expression in infix to its equivalent postfix notation?
- The prefix form of an infix expression (p + q) – (r * t) is?
- Which of the following is an infix expression?
- The complexity of Binary search algorithm is ____________.
- The complexity of Bubble sort algorithm is _________.
- The complexity of linear search algorithm is____________.
- Consider the usual algorithm for determining whether a sequence of parentheses is balanced. Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order). The maximum number of parentheses that appear on the stack AT ANY ONE TIME during the computation?