Which of the following conditions is checked into the stack before performing the 'insertion' operation?

In which of the following binary trees is every level, except possibly the last, completely filled?

In which of the following linked lists is the null pointer in the last node replaced with the address of the first node?

Which of the following graphs has more than one edge between the same two vertices?

Which of the following properties is a transitive relation defined on the elements of the list and specified by the sequence in which the elements appear within the list?

Which of the following operations is also called processing of each node of linked list exactly once?

Which of the following techniques is used to collect all the free cells and store them in free pool?

Which of the following traversal techniques begins with the root, then proceeds towards the end of the left subtree and then, towards the right subtree?

Which of the following conditions must be verified before inserting a new element into the stack?

Which of the following graphs has no path and starts and ends at the same vertex?

Which of the following data structures can be defined as an undirected tree of a connected graph G which is composed of all the vertices and the edges necessary to connect all the nodes of graph G?

Which of the following properties is the maximum level attributed to any element within the list or within any sublist in the list?

Which of the following techniques can be used for implementing indexes?

Which of the following parts is read and written by a system?

Which of the following types of external sorting techniques is the one in which the basic idea is to distribute ordered initial runs of predetermined size on the available tapes and repeatedly merge these runs in multiple phases, in which each phase has a predetermined number of merges before the target tape is selected?