A binary heap is a simple concrete heap data structure using a binary tree. Binary heaps perform all operations in O(log n) time, except examining the root (minimum/maximum) element, which is constant time. They do not support a merge operation. They are often represented as complete binary trees stored implicitly in arrays; this representation is used in heapsort, for example.hijackerhijacker
Pages in category "Binary heap"
This category contains only the following page.