HEAP

Which of the following are min heaps?

• A

• B

• C

• D

How many swaps are made in the min heap when inserting the value 18?

• 0

• 1

• 2

• 3

What operation has efficiency O(1) using the java.util.PriorityQueue class?

• Peek()

• Pop()

• Poll()

• Remove()

Which of the following PriorityQueue<E> methods will throw an exception when used on an empty queue?

• remove()

• poll()

• pop()

• peek()

When removing the root from a min heap, what is the first step?

• Replace the root with the next smallest value from the tree

• Replace the root with the leaf furthest to the left on the bottom level of the tree

• Replace the root with the leaf furthest to the right on the bottom level of the tree

• Replace the root with the smallest of its children

The formula for finding the right child of a node in a heap stored in an array is ________ . (The root is at index 0)

• ( 2 * Parent ) + 2

• ( 2 * Parent ) + 1

• ( 2 * Parent ) + 3

• ( 2 * Parent )

What is the process of 'heapifying' in Heap Sort?

• 
  Arranging elements in a heap data structure

• Sorting elements in reverse order

• 
  Removing elements from the heap

• Randomly shuffling the elements

What is the purpose of the heapifying process in Heap Sort?

• 
  To maintain the heap property by arranging the elements in the correct order.

• 
  To sort the elements in ascending order

• 
  To randomize the order of elements

• 
  To remove all the elements from the heap

What is the time complexity of Heap Sort in Java?

• 
  O(1)

• 
  O(n)

• O(n log n)

• O(n^2)

Create a HashMap where the values are lists using Integer Wrapper Class