Insertion in Heap Data Structure - Step by Step Working with Diagram (With Full C++ Code) |

[@ManishSharma-fi2vr]

Your DRY run explanation is awesome !! It clears the picture. It's gives us a better visualization. 💕Thank You For Your Efforts.

[@SimpleSnippets]

Thanks Manish! Yes I myself used to understand algorithms using this method. It takes some time and efforts but once you get the step by step flow then it's very easy to remember without mugging it up👍🤟

[@ManishSharma-fi2vr]

@@SimpleSnippets Thank You for your valuable advice sir !!

[@ayushkumarranjan267]

Your voice gives comfort. There is no better explainer than you sir. You are my lieutenant in DSA battle salute sir.

[@yamilz32]

This channel is underrated, a lot of effort was put in here, cannot believe there are 10x more views than thumbs up. I followed the entire DSA course, waiting for hash and graphs. Also, hopefully you can go with deep Java tutorials as you did with this DSA ones. Thanks.

[@SimpleSnippets]

Much appreciated!

[@srushtikadam1514]

I agree, such clear explanation is so rare to find

[@cmcatholic1798]

Man you are very articulate about what you teach , keep up the good work 👍👍👍👍

[@shreyanshx]

Man keeep making videos like these! You're a saviour!

[@SimpleSnippets]

I will🤟 thanks bro 😊

[@shwetpandey3479]

bro waiting for long time to watch your video

[@zavier3436]

please complete full DSA curse as soon as possible...you are saving my life

[@jamesnash9675]

you r the best...masum

[@mrenankrastogi2404]

Crazy explanation man, thanks :)

[@SwathiA_]

thank you for your explanation .

[@emcemimotionandcontrol5554]

Very good explanation.

[@ElifArslan-l9g]

you are amazing

[@Mozamel89]

Perfect

[@ant9177]

that harray should be filled from index 1 .. because from any node if we do i/2 , that will lead us to its parent . If a child is in 2'th pos in array . It parent should be in 1'th postion. But here , it's in 0'th postion

[@salilshukla2686]

Sir I am going to finish nearly all the videos. Please upload Graph videos also.

[@anexocelisia9377]

insertion with heap data structure for the min heap we'll compare the node value where we want to insert (bottom generally -> leaf node) with the parent and if the value of the parent is more than the curr val, then simply swap the element each and every time untill either the loop breaks or the curr reaches the root node. for the insertion we also check for heap full (if harr == capacity)

[@stevenmascarenhas1955]

1st one here😁

[@sid792]

Plz make video on array like insersion , deletion, at starting nd end point

[@rex-dj5cu]

Thanks sir

[@nadraibrahim6400]

no check for duplicate values?

[@RahulGupta-hh4yu]

You are missing to check duplicate value in the MinHeap.

[@yashikathakur5379]

There are no restrictions against duplicate values in heaps, as unlike BST left node doesn't have to be smaller than the right node

[@mominasohail5419]

sir your code is not working

[@hamdaaziz0]

Bhai ap itny syanyy kesy ho😃😃😃😃😃😃

[@abishekshah1693]

package heapDataStructure; import java.util.*; public class implementationofHeap { int data; int capacity=7; int heap[]=new int[capacity]; int heap_size=0; public void insert(int data) { if(heap_size==capacity) { System.out.println("overflow"); return; } heap_size++; int i=heap_size-1; heap[i]=data; while(i!=0 && heap[parent(i)] > heap[i]){ swap(heap[i],heap[parent(i)]); i=parent(i); } } void print() { for(int i=0;i