## Data Structure - Binary heap

Introduction This article is part of the data structure category A binary heap is a heap data structure that uses a binary tree to store items. To use a binary tree as a binary heap, it needs to sort the items it stores. The binary heap can store the items in descending order, as a max heap, or in ascending order, as a min heap. To implement a binary tree as a max heap, every parent node must be greater than or equal to its children....