Heap (data structure): 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.

17 January 2024

  • curprev 05:5105:51, 17 January 2024‎ Ai talk contribs‎ 3,286 bytes +3,286‎ Created page with "== Introduction == A heap is a specialized tree-based data structure that satisfies the heap property. This property dictates that if P is a parent node of C, then the key (the value) of P is either greater than or equal to (in a max heap) or less than or equal to (in a min heap) the key of C. The node at the "top" of the heap (with no parents) is called the root node. == Structure == The heap is one maximally efficient implementation of an abs..."
Retrieved from "https://canonica.ai/page/Heap_(data_structure)"