Bissoy.com
Doctors Medicines MCQs Q&A

If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.

If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start. Correct Answer 2

As the root is deleted and node with value 100 is used as replaced one. There is a violation of property that root node must have value less than its children. So there will be shuffling of node with value 100 with node of value 2. And thus 2 becomes root. And it will remain to be at root after all the possible operations. So the value at root will be 2.

Related Questions

An Identity Card has the number ABCDEFG, not necessarily in that order, where each letter represents a distinct digit (1, 2, 4, 5, 7, 8, 9 only). The number is divisible by 9. After deleting the first digit from the right, the resulting number is divisible by 6. After deleting two digits from the right of original number, the resulting number is divisible by 5. After deleting three digits from the right of original number, the resulting number is divisible by 4. After deleting four digits from the right of original number, the resulting number is divisible by 3. After deleting five digits from the right of original number, the resulting number is divisible by 2. Which of the following is a possible value for the sum of the middle three digits of the number?
Consider the following statements: I. The smallest element in a max-heap is always at a leaf node II. The second largest element in a max-heap is always a child of the root node III. A max-heap can be constructed from a binary search tree in Θ(n) time IV. A binary search tree can be constructed from a max-heap in Θ(n) time Which of the above statements are TRUE?
If we implement heap as maximum heap , adding a new node of value 15 to the left most node of right subtree. What value will be at leaf nodes of the right subtree of the heap.
An operator delete(i) for a binary heap data structure is to be designed to delete the item in the i-th node. Assume that the heap is implemented in an array and i refers to the i-th index of the array. If the heap tree has depth d (number of edges on the path from the root to the farthest leaf), then what is the time complexity to re-fix the heap efficiently after the removal of the element? 
In a dicot pot herb, vaseline/vegetable oil was applied on the upper surface of one leaf (Experimental leaf 1) and on the lower surface of another leaf (Experimental leaf 2). Vaseline/Vegetable oil was not applied to the control leaf. The plant was deliberately not watered for several days. Which leaf will dry up last?
A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node and the near node of the queue, respectively. Which of the following statements is/are CORRECT for such a circular queue, so that insertion and deletion operations can be performed in O(1) time? I. Next pointer of front node points to the rear node. II. Next pointer of rear node points to the front node.
Three statements are followed by four conclusions numbered I, II, III and IV. You have to consider these statements to be true, even if they seem to be at variance with commonly known facts, decide which of the given conclusions logically follow(s) from the statements. Statements: 1. No plant is a flower. 2. No flower is a leaf. 3. Some plants are leaf. Conclusions: I. No leaf is a plant. II. No leaf is a flower. III. Some flowers are plants. IV. All leaf are plants.
Which of the following statements are CORRECT? 1) Static allocation of all data areas by a compiler makes it impossible to implement recursion. 2) Automatic garbage collection is essential to implement recursion 3) Dynamic allocation of activation records is essential to implement recursion 4) Both heap and stack are essential to implement recursion
A teacher of Class VII demonstrates the following activity in the class: “A leaf is put in a test tube and spirit is poured over it. Then the test tube is put in a beaker half-filled with water and heated till the leaf is discoloured. The leaf is then taken out and a few drops of iodine are put on it. The leaf turns blue-black in colour.” After this activity, the teacher gives some questions for the assessment of various indicators of learning. Which of the following would assess ‘analysis’?
The following lines talks about deleting a node in a binary tree.(the tree property must not be violated after deletion) i) from root search for the node to be deleted ii) iii) delete the node at what must be statement ii) and fill up statement iii)