# Category - Heap

## k largest(or smallest) elements in an array | added Min Heap method

Question: Write an efficient program for printing k largest elements in an array. Elements in array can be in any order. For example, if given array is [1, 23...

## python programming Heap Sort

Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort where we first find the maximum element...

## java programming Heap Sort

Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort where we first find the maximum element...

## C++ programming Heap Sort

Heap sort is a comparison based sorting technique based on Binary Heap data structure. It is similar to selection sort where we first find the maximum element...

## Fibonacci Heap

Heaps are mainly used for implementing priority queue. We have discussed below heaps in previous posts. Binary Heap Binomial Heap In terms of Time Complexity...

## Why is Binary Heap Preferred over BST for Priority Queue?

Why is Binary Heap Preferred over BST for Priority Queue? - A typical Priority Queue requires following operations to be efficient.

## Applications of Heap Data Structure

Applications of Heap Data Structure - Heap Data Structure is generally taught with Heap sort. Heap sort algorithm has limited uses.

## Time Complexity of building a heap

Time Complexity of building a heap - Heap - Although the worst case complexity looks like O(nLogn), upper bound of time complexity is O(n).

## python programming Binary heap

python programming Binary heap - It’s a complete tree (All levels are completely filled except possibly the last level and the last level ).

## C++ programming Binary heap

C++ programming Binary heap - Binary heap - It’s complete tree (All levels are completely filled except possibly the last level and the last level).