
- Data Structures & Algorithms
- DSA - Home
- DSA - Overview
- DSA - Environment Setup
- Algorithm
- DSA - Algorithms Basics
- DSA - Asymptotic Analysis
- DSA - Greedy Algorithms
- DSA - Divide and Conquer
- DSA - Dynamic Programming
- Data Structures
- DSA - Data Structure Basics
- DSA - Array Data Structure
- Stack & Queue
- DSA - Stack
- DSA - Expression Parsing
- DSA - Queue
- Searching Techniques
- DSA - Linear Search
- DSA - Binary Search
- DSA - Interpolation Search
- DSA - Hash Table
- Sorting Techniques
- DSA - Sorting Algorithms
- DSA - Bubble Sort
- DSA - Insertion Sort
- DSA - Selection Sort
- DSA - Merge Sort
- DSA - Shell Sort
- DSA - Quick Sort
- Graph Data Structure
- DSA - Graph Data Structure
- DSA - Depth First Traversal
- DSA - Breadth First Traversal
- Tree Data Structure
- DSA - Tree Data Structure
- DSA - Tree Traversal
- DSA - Binary Search Tree
- DSA - AVL Tree
- DSA - Spanning Tree
- DSA - Heap
- DSA Useful Resources
- DSA - Questions and Answers
- DSA - Quick Guide
- DSA - Useful Resources
- DSA - Discussion
Binary Heap in Data Structure
Heap or Binary Heap is a special case of balanced binary tree data structure. This is complete binary tree structure. So up to l-1 levels it is full, and at l level, all nodes are from left. Here the root-node key is compared with its children and arranged accordingly. If a has child node b then −
key(a) ≥ key(b)
As the value of parent is greater than that of child, this property generates Max Heap. Based on this criteria, a heap can be of two types the Max Heap and the Min Heap.
These are examples of Max and Min Heap respectively −
- Related Articles
- Insertion into a Max Heap in Data Structure
- Deletion from a Max Heap in Data Structure
- Binary Tree ADT in Data Structure
- Threaded Binary Trees in Data Structure
- Unrooted binary tree in Data Structure
- Balanced binary search trees in Data Structure
- Binary Trees as Dictionaries in Data Structure
- Golang program to implement binary tree data structure
- Array Representation Of Binary Heap
- C++ Program to Implement Binary Heap
- Rectangle Data in Data Structure
- Check if a given Binary Tree is Heap in Python
- Check if a given Binary Tree is Heap in C++
- Deaps in Data Structure
- Quadtrees in Data Structure

Advertisements