Heap Data Structure | Illustrated Data Structures

Heap is a tree-based data structure that follows the properties of a complete binary tree and is either a Min Heap or a Max Heap. In this video, we will be covering the different types of Binary Tree, the difference between a Full Binary Tree and a Complete Binary Tree, what the heap data structure is, the difference between Min Heap and Max Heap, and different operations you can perform on a heap, algorithmic complexity of heap operations and uses of heap data structure.

0:00 Introduction
0:20 Types of Binary Tree
2:49 Heap Data Structure
3:03 Min Heap
4:02 Max Heap
4:58 Heap Insertions
8:19 Heap Deletions
10:47 Uses of Heap Data Structure

Data Structures Playlist:

Channel website:

Discord Community:

Find us on the internet:

[arantebw]

🤯 Amazing! Simple, clear, and concise. Please, keep it up. Thank you! 🙏

[zscoder]

Enjoyed the explanation, but icing on the cake was how this can be applicable in real world scenario

[bpriorb]

Excellent. Very nicely and concisely explained. I see you left out the array representation and how parent/child nodes are computed. Probably the right choice. Subscribed.

[anirbanc]

data structure playlist is awesome Kamran, thank you!

[タクリス]

great content! thank you so much <3

[universal]

Please do videos regularly. Please please

[unknownvibes]

In the example to understand the complete binary tree...if we remove only node G from node C then there is only one node remains attached to node C....How it become the binary tree 😢

[JubayerAhmed-xosj]

if u implement any theory that i would request you to do it with C++. Its help a lot then.