When elements are deleted the nodes go to_________.

Related MCQs

• If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?
• A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?
• If the elements A, B, C and D are placed in a stack and are deleted one at a time, what is the order of removal?
• A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
• In a full binary tree if number of internal nodes is I, then number of nodes N are?
• The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
• A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.
• The OS of a computer may periodically collect all the deleted space onto the free storage list. This technique is called______________.
• Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are
• An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of