Sciomi uses Google Analytics to measure how the site is used. If you accept, it stores a cookie on your device. If you decline, it stores nothing on your device, but Google may still receive a basic signal that a page was opened. Sign-in and practice progress cookies are always used. No ads are shown. Details in the privacy policy

Heaps & priority queues

Computer Science · Data structures

Loading practice question…

About this practice set

Heaps & priority queues is a Computer Science quiz (Data structures) with 5 multiple-choice questions. Pick an answer and read the explanation that follows.

What you will be asked

  • A min-heap has the smallest element at the:
  • A heap is stored in an:
  • Removing the minimum from a min-heap takes:
  • Priority queues are often built from:
  • The heap property requires parents to be: