Array, Linked list, Stack and Queue

Which of the following was used for traversal in topological sort

• pre-order

• post-order

• in-order

• level order

______ will point to the first node in linked list

• head

• link

• node

• pointer

In doubly linked list, each node contains a pointer to _______

• the previous node

• to the next node

• both previous and next node

• none of the above

______ is one of the advantages using linked list compared to array.

• Easy to resize

• Cache friendly

• Constant time to access elements

• All of them

______ is the correct time complexity for searching an element in a linked list

_____ and _____ are the two nodes in a circular linked list.

Generate the postfix form from the following infix expression

(2-3+4)*(5+6*7)

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

Push("A");

Pop();

Push("Z");

Push("I");

Pop();

Push("A");

Pop();

Pop();

Push("H");

After the completion of all operation, identify the no of element left on stack

• 2

• 3

• 4

• 1