Tree is recognised as a non-linear data structure as data is stored in it in random order.

This is the most essential condition required for performing binary search as correct values of pointers; Low, Mid and High can only be provided when the list is in increasing order.

Traversing is the process of accessing each element of the array exactly once to do some operation.

Row-major order is the order in which all the first row elements are stored in sequential memory location then all the second row elements are stored and so on.

This is the greatest disadvantage as once the size of the arrays is specified it remains fixed until the user changes it.

This is the operation in which a new data or element is inserted into the stacks.

This is the correct option as array subscript starts from 0, so it can have maximum of N - 1 subscript value from N number of elements.

This is the correct form of postfix expression for the given infix expression as in postfix expression operands come before the operators and also the precedence of operators is followed while evaluating any infix expression into postfix one.

This operator is used in C++ to dynamically allocate memory space for a new node in the linked list.

This type of queue is the one in which all nodes are treated as circular such that the last node follows the first node.

This pointer is incremented in a queue when a new element is added.

This is the technique in which if a node is deleted from the linked list then the memory space of the deleted node is immediately reinserted into the free storage.

This datatype is used in C++ to implement linked list in a program.

This is the first operation performed on a linked list.

Complete tree is a tree in which each leaf node is at the same distance from the root.