Heap Allow Mark with airSlate SignNow

Heap write signed electronically

Hey what's up guys! ANUJ here and welcome to the DSA one course. In today's video we're going to learn about Heap data structure. So, heap is a very Important data structure. And today we're going to understand it in a very beginner friendly way We're going to deal with Insert and Delete operation in it. In the upcoming video, we'll learn about Heapify, Heap sort and how it is created So, it is very important. Many of the questions are solved through this. Basically, Heaps help in implementing priority queue, in multiple algorithms and graphs So, first of all I've made some binary trees. Heap is basically, a binary tree type data structure I've written its definition here. Heap is a complete Binary tree that satisfies a heap's property. and we're going to understand these two points--- Complete Binary Tree and Heap's Property, what do they mean!! First of all what is a complete binary tree? What is a binary tree? Binary tree is a data structure, where each node has at most 2 children This node has atmost two, this node might have two again and then another node might have 0 as well. This is also a binary tree here. It has 2 nodes and this one has only one children so atmost two children are there. But, a complete binary tree is that binary tree, in which each node has two children and the node at the last level it isn't necessary to have two children but, the placement in it will always start from the left position. Right, are you understanding? Basically, this is not a complete binary tree. It is a binary tree but it isn't a complete binary tree, why? Because, here it has 2 children, at this level it isn't necessary to have two children but it should always start from the left position. Here, its left position is empty. So it isn't a complete binary tree. Similarly, this is also not a complete binary tree, as I said that each node should atleast have 2 children So, this node doesn't have 2 children, it has only one children and the other position is empty so, this is also not a complete binary tree. Rest, this is a complete binary tree, this onw as well and they are also a complete binary tree so we understood that heap is a complete binary tree. Apart from that--it satisfies a Heap's property. Let's understand what is a heap's property. So, heap is of 2 types. One is a max heap and the other is min heap. Both are used. If we understand the first one, then the other would be similar to understand, its not so difficult. Let's understand the max heap. The heap property of max heap is that its children would always be smaller than itself. the value of the children would always be smaller than it. Just like here, the value of the node is 50 then the value of its...