Quiz – 1

Explanation: This is one of the property of max-heap that root node must have key greater than its children.

Explanation: Yes, Because the leaf nodes are present at height h or h-1, which is a property of complete binary tree.

Explanation: The total possible operation in re locating the new location to a new element will be equal to height of the heap.

Explanation: The total possible operation in deleting the existing node and re locating new position to all its connected nodes will be equal to height of the heap.

Explanation: The property of heap that the value of root must be either greater or less than both of its children makes it work like a priority queue.

Explanation: 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.

Explanation: As 15 is less than 25 so there would be no violation and the node will remain at that position.So leaf nodes with value 15 and 1 will be at the position in right sub tree.

Explanation: The total time taken will be N times the complexity of adding a single element to the heap. And adding a single element takes logN time, so That is equal to N*logN.

Explanation: Heap sort is based on the algorithm of priority queue and it gives the best sorting time.

Explanation: The array for heap sort contains data at position 0 whereas for a binary heap, array begins at 1. This is the reason for its complexity.