What is the time complexity of an infix to postfix conversion algorithm?

O(N log N)

O(N)

O(N2)

O(M log N)

The time complexity of an infix to postfix expression conversion algorithm is mathematically found to be O(N).

Here is an infix expression: 4 + 3(63-12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation. The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression?

Both are easy to implement

Conversion of postfix equation to infix equation is harder than converting a prefix notation to infix notation

Conversion of postfix equation to infix equation is easier than converting a prefix notation to infix notation

Insufficient data

True

False

operand is always placed in the output

operator is placed in the stack when the stack operator has lower precedence

parenthesis are included in the output

higher and equal priority operators follow the same condition

right to left

left to right

centre to left

centre to right

True

False

O (N)

O (N log N)

O (N2)

O (M log N)

Tree

Branch

Stack

Queue

(A B D ⋀ + E F – / G +)

(A B D +⋀ E F – / G +)

(A B D ⋀ + E F/- G +)

(A B D E F + ⋀ / – G +)

xyz*+pq*r+s*+

xyz*+pq*r+s+*

xyz+*pq*r+s*+

xyzp+**qr+s*+