HOTS on Heaps and Sets

Which of the following statements correctly describes a Min Heap?

• The value of each parent node is greater than or equal to its child nodes.

• The value of each parent node is less than or equal to its child nodes.

• The value of each node is unique and arranged randomly.

• The root node must always be a negative number.

In a Max Heap, the root node:

• Has no child nodes.

• Has the smallest value in the heap.

• Contains the highest value compared to its child nodes.

• Is always equal to 1.

Which method retrieves the root node of a heap in Java?

• add()

• get(0)

• remove()

• poll()

Consider the following Java code snippet: ArrayList heap = new ArrayList<>(); Collections.addAll(heap, 2, 5, 1, 9, 4); Which index contains the root node?

• 1

• 0

• 4

• 2

A priority queue processes elements based on:

• FIFO (First-In, First-Out) order.

• The insertion order.

• Their priority (natural or custom).

• Their memory location.

To create a priority queue in Java using custom ordering, you need a:

• HashSet.

• Comparator.

• TreeSet.

• LinkedList.

Which Java interface provides methods like comparing() and compare() for custom sorting in priority queues?

• Iterable

• Comparator

• Queue

• HashSet

A Min Heap and a Priority Queue both share which common property?

• Both use HashMap for storage.

• Both allow duplicate entries.

• Both ensure that the smallest element is processed first.

• Both use only natural ordering.

Which of the following is not a property of a set?

• Elements must be unique.

• Duplicate elements are allowed.

• The order of elements is not guaranteed in a HashSet.

• Elements can be retrieved based on a key.

Which Java class should you use if you want a set that maintains the order of insertion?

• HashSet

• TreeSet

• LinkedHashSet

• PriorityQueue