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: https://youtube.com/playlist?list=PLkZYeFmDua… Channel website: - https://roadmap.sh Discord Community: https://discord.gg/cJpEt5Qbwa Find us on the internet: - https://twitter.com/roadmapsh - https://twitter.com/kamrify - https://github.com/kamranahmedse/developer-ro… - https://www.linkedin.c