Skip to content

CSCI2100 · Definition · Chapter 3 · Priority queues

Almost-heap at an index

2 steps of prerequisites below it

An array is an almost-heap at i when the subtrees rooted at the children of i are min-heaps although the key at i may exceed a child key; h(i) is the height of node i.

Taught in

Builds on

Used by

Everything this builds on, earliest first · 2 steps

Each step comes after its own prerequisites, so reading in this order never needs something you have not met. It is a reading order for these notes, not a diagnosis of what you know.

  1. Min-priority queue · 3.1
  2. Binary min-heap · 3.1

Possible roots and a review route need your own answers on these points. None are recorded yet, so none are suggested.

Longest chain down to a starting point

Each step is used by the one above it, across courses where the notes link them. It ends at a point the notes define without another point.

  1. Binary min-heap
  2. Min-priority queue

Back to the graph →Read the note 3.2 →

Vercel visit statistics and public-page performance measurements each require separate consent. Neither is needed to use the website.

Website function storage (used when needed)

Security, sign-in and your chosen preferences use storage when needed. This is separate from optional statistics.

Withdrawing stops future statistics. The page reloads if analytics code needs unloading. It does not delete data already sent.

Read Cookie and storage details