Stack

Accessing top element in stack is constant time operation.

Only top element can be accessed in stack

Stacks have LIFO ordering

The postfix form of the expression (A+ B)*(C*D- E)*F / G is?

The prefix form of A-B/ (C * D ⋀ E) is?

The postfix form of A*B+C/D is?

Which of the following statement(s) about stack data structure is/are NOT correct?

If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, in what order will they be removed?

Consider the following operation performed on a stack of size 5.

Push(1);

Pop();

Push(2);

Push(3);

Pop();

Push(4);

Pop();

Pop();

Push(5);

After the completion of all operation, the no of element present on stack are