Graph is a non-linear data structure where data is stored in hierarchical form.

A set of values (carrier set) and operations on those values is called Abstract Data type (ADT). Example: For Boolean ADT carrier set is {True, False} and negation, conjunction, etc. are operations on it.

It is not a true statement about a stack. Since in a stack after insertion operation, the value of top is incremented.

Pop operation is the name of deletion operation in a stack, which pop or delete items from the stack.

This is a wrong answer. Since in a queue, data is inserted from the rear end of the queue and is deleted from the front end of the queue.

An arrangement of data in memory locations to represent values of carrier set of abstract data type is called data structure.

Accessing each item exactly once, so that certain items in the record may be processed is called a traversing operation.

Reverse polish notation form is also called a postfix form where the operator is placed after two operands.

Dequeue is a data structure in which elements may be added to or deleted from the front or the rear.

This is the wrong answer since they have a recursively defined data structure.

It is the right answer. According to the given operations, first push A, then B and C. After that, perform the pop operation two times. This will delete B and C. Now again, push D and E, at last perform the pop operation, which deletes the last inserted item E. Now, the value of the top of the stack is D.

It is a right answer since it is based on 'divide and conquer' method, which requires a middle element. Pivot is used for this.

This is the right operation. This condition is called overflow.

It is the correct prefix notation. Here, in the given expression, "A + B * C", * has a higher priority +. * is between B and C, so it placed after BC, then + is placed after it, so we get  "+ A * BC".

This is the correct answer. We calculate it using stack; we push operands into stack and when an operator will come, then push top two elements and perform the necessary operation. According to this, we get 10 -> 105 -> 10, 51 -> 10, 5, 1+ -> 10, 6+ -> 164 -> 16, 4/ -> 4. This is the final value.

The maximum number of child nodes in a B-tree is m since B-tree is a balanced m-way search tree, not a binary tree.

Circular singly linked list is a linked list where the pointer in the last node points back to the first node.

This is the correct postorder traversal of the binary tree. Here, we first create the tree using preorder and inorder traversal. Then, find out postorder traversal. First select root from the given preorder that is I. Now, select its left subtree nodes and the right subtree nodes from inorder. We continue to apply this process until all nodes are not finished.

This is the correct preorder traversal of the binary tree. Here, we first create the tree using postorder and inorder traversals. Then, find out the preorder traversal. First select root from given postorder that is P, now select its left subtree [LST] nodes and right subtree [RST] nodes from inorder. The LST node of root P is S Q T and RST nodes of P is R U. Now, take S Q T and apply the same process. Here, we get root node Q from postorder [S T Q] and its LST and RST nodes from inoder [S Q T]. Similary, we take R U and apply the same process. Here, we get root node R from postorder [U R] and its LST and RST nodes from inoder [R U].

It is correct answer.

In folding method, a key is broken into several parts and each part has the same length as that of the required address except the last part.

This is correct reverse polish notation.-> P * Q ^ [ R S ^ ] + T-> P * [ Q R S ^ ^ ] + T-> [ P Q R S ^ ^ * ] + T-> P Q R S ^ ^ * T +

It is an incorrect statement about B-tree. In a B-tree, all leaves are on the same level.

Root node is a node without a parent.

When a node with 2 child nodes is deleted, then it is replaced by its next inorder successor node.

In an expression binary tree, the internal node stores operators.

Collection of trees is known as Forest.

Degree of node is the number of direct children of the given node.

Graph is used for finding minimum spanning tree.

It is an incorrect statement since if full binary tree T has a total of N nodes, the number of internal nodes is I = (N – 1)/2. And the number of internal nodes is I = (N + 1)/2.

Complete bianry tree is a type of binary tree in which all levels except possibly the last are full, and the last level has all its nodes to the left side.