{
  "id": "enwiki-001371608911",
  "slug": "binary-heap",
  "title": "Binary heap",
  "qid": "",
  "lead": "A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues. The binary heap was introduced by J. W. J. Williams in 1964 as a data structure for implementing heapsort. A binary heap is defined as a binary tree with two additional constraints: *Shape property: a binary heap is a complete binary tree; that is, all levels of the tree, except possibly the last one (deepest) are fully filled, and, if the last level of the tree is not complete, the nodes of that level are filled from left to right. *Heap property: the key stored in each node is either greater than or equal to (≥) (or less than or equal to (≤)) the keys in the node's children, according to some total order. Heaps where the parent key is greater than or equal to (≥) the child keys are called max-heaps; those where it is less than or equal to (≤) are called min-heaps. Efficient (that is, logarithmic time) algorithms are known for the two operations needed to implement a priority queue on a binary heap: *Inserting an element; *Removing the smallest or largest element from (respectively) a min-heap or max-heap.…",
  "body": "A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues. The binary heap was introduced by J. W. J. Williams in 1964 as a data structure for implementing heapsort. A binary heap is defined as a binary tree with two additional constraints: Shape property: a binary heap is a complete binary tree; that is, all levels of the tree, except possibly the last one (deepest) are fully filled, and, if the last level of the tree is not complete, the nodes of that level are filled from left to right. Heap property: the key stored in each node is either greater than or equal to (≥) (or less than or equal to (≤)) the keys in the node's children, according to some total order. Heaps where the parent key is greater than or equal to (≥) the child keys are called max-heaps; those where it is less than or equal to (≤) are called min-heaps. Efficient (that is, logarithmic time) algorithms are known for the two operations needed to implement a priority queue on a binary heap: Inserting an element; Removing the smallest or largest element from (respectively) a min-heap or max-heap. Binary heaps are also commonly employed in the heapsort sorting algorithm, which is an in-place algorithm as binary heaps can be implemented as an implicit data structure, storing keys in an array and using their relative positions within that array to represent child–parent relationships. ==Heap operations== Both the insert and remove operations modify the heap to preserve the shape property first, by adding or removing from the end of the heap. Then the heap property is restored by traversing up or down the heap. Both operations take time. === Extract=== The procedure for deleting the root from the heap (effectively extracting the maximum element in a max-heap or the minimum element in a min-heap) while retaining the heap property is as follows: Replace the root of the heap with the last element on the last level. Compare the new root with its children; if they are in the correct order, stop. If not, swap the element with one of its children and return to the previous step. (Swap with its smaller child in a min-heap and its larger child in a max-heap.) Steps 2 and 3, which restore the heap property by comparing and possibly swapping a node with one of its children, are called the down-heap (also known as bubble-down, percolate-down, sift-down, sink-down, trickle down, heapify-down, cascade-down, fix-down, extract-min or extract-max, or simply heapify) operation. So, if we have the same max-heap as before, we remove the 11 and replace it with the 4. Now the heap property is violated since 8 is greater than 4. In this case, swapping the two elements, 4 and 8, is enough to restore the heap property and we need not swap elements further. The downward-moving node is swapped with the larger of its children in a max-heap (in a min-heap it would be swapped with its smaller child), until it satisfies the heap property in its new position. This functionality is achieved by the Max-Heapify function as defined below in pseudocode for an array-backed heap A of length length(A). A is indexed starting at 1. // Perform a down-heap or heapify-down operation for a max-heap // A: an array representing the heap, indexed starting at 1 // i: the index to start at when heapifying down Max-Heapify(A, i): left ← 2×i right ← 2×i + 1 largest ← i if left ≤ length(A) and A[left] > A[largest] then: largest ← left if right ≤ length(A) and A[right] > A[largest] then: largest ← right if largest ≠ i then: swap A[i] and A[largest] Max-Heapify(A, largest) For the above algorithm to correctly re-heapify the array, no nodes besides the node at index i and its two direct children can violate the heap property. The down-heap operation (without the preceding swap) can also be used to modify the value of the root, even when an element is not being deleted. In the worst case, the new root has to be swapped with its child on each level until it reaches the bottom level of the heap, meaning that the delete operation has a time complexity relative to the height of the tree, or O(log n). ==Building a heap (Heapify)== Building a heap from an array of input elements can be done by starting with an empty heap, then successively inserting each element. Equivalently, the heap may be constructed by first arbitrarily placing the elements into the binary tree, then up-heapifying each node successively, which allows in-place heapification. This approach, called Williams' method after the inventor of binary heaps, is easily seen to run in time: it performs insertions at cost each. However, Williams' method is suboptimal. A faster method (due to Floyd ) starts by arbitrarily putting the elements on a binary tree, respecting the shape property (the tree could be represented by an array, see below). Then starting from the lowest level and moving upwards, sift the root of each subtree downward as in the deletion algorithm until the heap property is restored. More specifically if all the subtrees starting at some height h have already been \"heapified\" (the bottommost level corresponding to h=0 ), the trees at height h+1 can be heapified by sending their root down along the path of maximum valued children when building a max-heap, or minimum valued children when building a min-heap. This process takes O(h) operations (swaps) per node. In this method most of the heapification takes place in the lower levels. Since the height of the heap is \\lfloor \\log n \\rfloor , the number of nodes at height h is \\le \\frac{2^{\\lfloor \\log n \\rfloor}}{2^h} \\le \\frac{n}{2^h} . Therefore, the cost of heapifying all subtrees is: \\begin{align} \\sum_{h=0}^{\\lfloor \\log n \\rfloor} \\frac{n}{2^h} O(h) & = O\\left(n\\sum_{h=0}^{\\lfloor \\log n \\rfloor} \\frac{h}{2^h}\\right) \\\\ & = O\\left(n\\sum_{h=0}^{\\infty} \\frac{h}{2^h}\\right) \\\\ & = O(n) \\end{align} This uses the fact that the given infinite series \\sum_{i=0}^\\infty i/2^i converges. The exact value of the above (the worst-case number of comparisons during the heap construction) is known to be equal to: 2 n - 2 s_2 (n) - e_2 (n) , where is the sum of all digits of the binary representation of and is the exponent of in the prime factorization of . The average case is more complex to analyze, but it can be shown to asymptotically approach comparisons. The Build-Max-Heap function that follows, converts an array A which stores a complete binary tree with n nodes to a max-heap by repeatedly using Max-Heapify (down-heapify for a max-heap) in a bottom-up manner. The array elements indexed by , , ..., n are all leaves for the tree (assuming that indices start at 1)—thus each is a one-element heap, and does not need to be down-heapified. Build-Max-Heap runs Max-Heapify on each of the remaining tree nodes. Build-Max-Heap (A): for each index i from floor(length(A)/2) downto 1 do: Max-Heapify(A, i) Only index i = b−1 can violate the heap property. Let j be the index of the largest child of a[i] (for a max-heap, or the smallest child for a min-heap) within the range b, ..., e. (If no such index exists because then the heap property holds for the newly extended range and nothing needs to be done.) By swapping the values a[i] and a[j] the heap property for position i is established. At this point, the only problem is that the heap property might not hold for index j. The sift-down function is applied tail-recursively to index j until the heap property is established for all elements. The sift-down function is fast. In each step it only needs two comparisons and one swap. The index value where it is working doubles in each iteration, so that at most log 2 e steps are required. For big heaps and using virtual memory, storing elements in an array according to the above scheme is inefficient: (almost) every level is in a different page. B-heaps are binary heaps that keep subtrees in a single page, reducing the number of pages accessed by up to a factor of ten. The operation of merging two binary heaps takes Θ(n) for equal-sized heaps. The best you can do is (in case of array implementation) simply concatenating the two heap arrays and build a heap of the result. A heap on n elements can be merged with a heap on k elements using O(log n log k) key comparisons, or, in case of a pointer-based implementation, in O(log n log k) time. An algorithm for splitting a heap on n elements into two heaps on k and n-k elements, respectively, based on a new view of heaps as an ordered collections of subheaps was presented in. The algorithm requires O(log n * log n) comparisons. The view also presents a new and conceptually simple algorithm for merging heaps. When merging is a common task, a different heap implementation is recommended, such as binomial heaps, which can be merged in O(log n). Additionally, a binary heap can be implemented with a traditional binary tree data structure, but there is an issue with finding the adjacent element on the last level on the binary heap when adding an element. This element can be determined algorithmically or by adding extra data to the nodes, called \"threading\" the tree—instead of merely storing references to the children, we store the inorder successor of the node as well. It is possible to modify the heap structure to make the extraction of both the smallest and largest element possible in O (\\log n) time. To do this, the rows alternate between min heap and max-heap. The algorithms are roughly the same, but, in each step, one must consider the alternating rows with alternating comparisons. The performance is roughly the same as a normal single direction heap. This idea can be generalized to a min-max-median heap. For a general node located at index (beginning from 0), we will first derive the index of its right child, \\text{right} = 2i + 2 . Let node be located in level , and note that any level contains exactly 2^l nodes. Furthermore, there are exactly 2^{l + 1} - 1 nodes contained in the layers up to and including layer (think of binary arithmetic; 0111...111 = 1000...000 - 1). Because the root is stored at 0, the th node will be stored at index (k - 1) . Putting these observations together yields the following expression for the index of the last node in layer . \\text{last}(l) = (2^{l + 1} - 1) - 1 = 2^{l + 1} - 2 Let there be nodes after node in layer L, such that \\begin{alignat}{2} i = & \\quad \\text{last}(L) - j\\\\ If the root is located at index 1 instead of 0, the last node in each level is instead at index 2^{l + 1} - 1 . Using this throughout yields \\text{left} = 2i and \\text{right} = 2i + 1 for heaps with their root at 1. i = 2 \\times (\\text{parent}) + 1 i = 2 \\times (\\text{parent}) + 2 Hence, \\text{parent} = \\frac{i - 1}{2} \\;\\textrm{ or }\\; \\frac{i - 2}{2} Now consider the expression \\left\\lfloor \\dfrac{i - 1}{2} \\right\\rfloor . If node i is a left child, this gives the result immediately, however, it also gives the correct result if node i is a right child. In this case, (i - 2) must be even, and hence (i - 1) must be odd. \\begin{alignat}{2} \\left\\lfloor \\dfrac{i - 1}{2} \\right\\rfloor = & \\quad \\left\\lfloor \\dfrac{i - 2}{2} + \\dfrac{1}{2} \\right\\rfloor\\\\ = & \\quad \\frac{i - 2}{2}\\\\ ==Related structures== Since the ordering of siblings in a heap is not specified by the heap property, a single node's two children can be freely interchanged unless doing so violates the shape property (compare with treap). Note, however, that in the common array-based heap, simply swapping the children might also necessitate moving the children's sub-tree nodes to retain the heap property. The binary heap is a special case of the d-ary heap in which d = 2. ==Summary of running times== ==References== ==External links== Open Data Structures - Section 10.1 - BinaryHeap: An Implicit Binary Tree, Pat Morin Implementation of binary max heap in C by Robin Thomas Implementation of binary min heap in C by Robin Thomas",
  "categories": [
    "23118434",
    "23603337",
    "24623845",
    "48526360",
    "59460332",
    "7692542"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1371608911",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1787820956.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001371608911",
    "type": "webpage",
    "title": "Binary heap",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/binary-heap",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001371608911",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1371608911",
    "note": "Immutable snapshot enwiki-001371608911"
  }
}