Jump to content

4.1.2.4 Heaps (Min-Heap, Max-Heap): Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

9 July 2025

  • curprev 15:5215:52, 9 July 2025 Mr. Goldstein talk contribs 2,219 bytes +2,219 Created page with "=== 4.1.2.4 Heaps: Finding the Biggest (or Smallest) Fast === Imagine a special pile of toys where the biggest toy is always at the very top, easy to grab. Or, imagine a pile where the smallest toy is always at the top. A '''heap''' in computer science is like that special pile! It's a tree-like data structure (but usually stored in a simple array) that helps you quickly find and grab the largest or smallest item. Heaps have two main rules: # It's a "complete binary tr..." Tag: Visual edit
Retrieved from "https://wiki.omnivision.website/index.php/4.1.2.4_Heaps_(Min-Heap,_Max-Heap)"