L-3.9: Insertion in Heap Tree | Max-Heap & Min-Heap Creation | Time Complexities

[@khordhaguy500]

Tomorrow is my exam i am watching today😂😂

[@adityarohilla8455]

Us bhay us

[@improvelife371]

Ofc

[@user-js2rh4lv7d]

much better am watching 1hr before exam

[@muskaankour9910]

I like your videos literally before watching them to the last .You are such a legend sir😇👏

[@SkyTechHacks]

Fabulous teacher👍❤️

[@mr.gamertech9]

Fantastic explanation ALLAH PAK BLESS YOU AND YOUR FAMILY SIR AMEEN

[@mushifkhan6034]

Thank u so much.. Very effective and explaned as no boday can do it as.. Thanks again.. Plz upload all topics about MS level

[@ManoMehnaz]

Bestest 🎉

[@waseembadaami7093]

Nice video Sir , its helpful for me because my paper start.

[@akashbansal5501]

👍❤️❤️

[@himanshusingh5118]

🙏🙏 Please provide Program (no need of theory)

[@lord_yzal]

completed

[@ambujacademy603]

sir plz starting ka jo sound hai plz remove kr dijiye bahut hi sir dard krne wala sound hai

[@sauravjain6135]

Your DBMS series very helpful , aap kaafi acche se samjhate ho sir. Aise hi video banate rahiye.

[@HassanAli-kp7tk]

❤️

[@sameera12393]

Seeing this vedio before 10 mint of exam😂😂

[@shayerrrr]

Good

[@technicalzyan]

5min left exam

[@Sidelineview]

Uss bro

[@TechInfo_Logy]

6 min left😂

[@hackerscammer6703]

Usss ho gaya ye to 😂

[@fitnesslover4341]

Watching 2 days before my semester exam 😂

[@ahanamishra1381]

3 hours before sem exam

[@RohanKumar-ij4nl]

You are really a great teacher. Not even a single concept taught by you is confusing. Your videos are gold. Thank You !

[@virajbele4839]

00:06 Importance of understanding Heap Tree Construction for Heap Sort 01:49 Heap Tree insertion methods have different time complexities. 03:29 Inserting elements in a Max Heap 04:42 Maintaining Max-Heap's property during insertion 06:03 Maintain parent and child relationships while building a max-heap. 07:29 Creating a max-heap involves step-by-step comparison and placement of elements. 08:53 Inserting one element in a complete binary tree involves log n swaps and comparisons. 10:20 Inserting a key into an already constructed heap has time complexities of log n for comparison and swapping in the worst case. Crafted by Merlin AI.

[@rizvi6837]

When i read this type of comments Seeing this video before 15 min or 16 hours or 1 day to me sochti m hi kyo 15 days phle dekhu dekh lungi exam vale din😂

[@Bazriya-p1f]

Haha yes bro me bhi yahi sochta hu😅

[@muntahariaz4332]

Vio🥰😍😍🥰 when I search any topic lecture related to my study,I firstly found our lecture in this channel 🥰. This channel clear my all subjects concept 👍🌹👌👌☀️☀️👍👌🌹🌹😍😍🥰

[@bhavin_kuwar]

not just a great explainer but also a great teacher, the efforts need to make this is huge, every details managed is great, the greetings given by him is also amazing. Really need this teachers in real life

[@siddharthsinghh]

Subscribers bahot jarrori hain

[@noorbakhsh4651]

I subscribed because I felt that it mandatory for me. As you teach us free.. So we must subscribe.. love from BALOCHISTAN 💓

[@zain_x_alpha]

I also

[@rajaabdulsaboor8655]

An excellent teacher Love from Pakistan

[@BhaktipadaBehera]

Sir aapki vidio mein bichmein boo black screen joo english mein translate karta hai boo thiik se joo white board mein likha hai dekhai nehin deya😢

[@satyamsharma7561]

Got this in my mid-sem exam today.

[@samiyaafzalminhas]

I struggle to catch-up with lectures I miss due to being absent but you help me catch-up 10/10 and it really helps since I struggle with stress!!!

[@chaitanya0257]

Then don’t be ABSENT!

[@AyeshaArshad-pc8yd]

right

[@vekariyadharmik7776]

Subscribers bahot jaruri hai 🔥🔥🔥🔥

[@anubratadas5277]

Sir sirf aapki wajah se me 4th semester ka apna syllabus complete kar paya hu :)

[@unnati8737]

Sir we have completed your lecture from where we solve the pdf

[@arjumandayoub8483]

I have a doubt sir said for logn + logn we just represent it with O(logn) then why do we for n elements represent it's order as O(nlogn) is it for the cases when n is large so we don't ignore n, while for other smaller values of n we just represent it with O(logn)?

[@flyingmachine6667]

Concepts taught very easily. U are such a Good teacher ❤😇

[@apnagallery8870]

Keep teaching us in same or may b more great way. We are always with you. Thank you sir and keep on .... 🔥🙏

[@Sleepy3DModel-le9pv]

Sir aapki video dekhke maam bura man gyi

[@nerd.coder_Abir]

I have completed my dsa syllabus in just 2 days because of your videos ❤❤❤❤. You are a gem

[@diprakshit]

seriously ?

[@nerd.coder_Abir]

@@diprakshit yes man ...

[@akashkushwaha7096]

Subscriber bahutt jarruri hai 🌝

[@tusharlohar2520]

End semister today thanks a lot 🙏🏽

[@MuhammadAhmed-id7tm]

min heap tu apna cover hi nhi kia apna

[@ahanamishra1381]

3 hours before my sem exam 😅

[@marygold3673]

Thank you so much sir❤ Now I'm studying this heap BT actually....mujhe isi video ki boht zarurat thi 😢😅 Ab mujhe samjh aagya ...7 mark in my pocket ❤❤❤thank you sir

[@I_am_the_Haider]

Sir can't we just arrange the given keys in descending order and then make a max heap by using one by one method of insertion? So that we'll get rid of this swapping at some steps? Moreover the time complexity will also become O(N) 😊

[@akashvegada5863]

Even the best of sorting algorithms takes O(n log n) time, hence it'll be the same thing if not worse

[@idocoding2003]

There is no way, literally no way .... Sir what you have... How can you make these topics so easy

[@thilangajayarathne6575]

I don't understand your language.but i got the whole concept very clearly without having any issues...thank you !!

[@muntahariaz4332]

Very good 😊😊👌👍 god bless you always ❣️

[@priyanshsinha8593]

Sir what will be the average case and worst case time complexity for the insertion? Please reply as I haven't got any replies for my prior doubts.

[@anjaligupta-ew6ns]

Sir video ka notification telegram pe ni dala ta

[@zahranaqvi9690]

Superb sir👌 From 🇵🇰♥️

[@AMANDHOL-f7v]

Itne short aur crisp tutorials kaise bana lete ho! AMazing!!!

[@dheerajvasisth8609]

Thank u so much sir for this video

[@ankurchoudhary8421]

Pr heap tree me to level wise 2 tree add krte h jo ki alg alg hoyge....ye to aapne ek hi tree me sab daal diya aisa kyu??

[@aqibhussain4504]

Wonderful Explanation Sir G

[@kevinmayani8347]

sir we can do one thing like we can arrange the keys in descending order and then simply put all the nodes in the tree. can we do that ??

[@savantmirje9486]

I think worst case time complexity O (log(n)sir. May be ur written O(n log (n)) which one is right sir 🙏

[@SIDDHANTRAAJ-q2h]

17/0/24 :)

[@ayanahmed8180]

Bro my University's given lecture is literally ur scrn shots of your videos lol

[@mpanghal9801]

U r great sir👌👌👌💐💐

[@PriyankaYadav-ut5qp]

Thank you so much sir for your all efort it's very useful for us... Your method was too good 👍

[@shoaibaltaf705]

Realy subscribers are important..... Than our concept 🥴

[@dushyantkashyap2595]

You are to good sir, now I'm your die heart fan. Keep it up.

[@vandanapranaviam]

Sir you're the best teacher.You teach very well sir.Thank you bhaiyaji for such a great and simple explanation

[@sufyanhussain2316]

watching this video during exam,, thank man

[@Alwaysbeunic1]

Today my exam and i am watching this video

[@ikitayadav3272]

how do u know all subjects so perfectly

[@EarnSmartTV540]

This line uff subscrber bht zarori ha

[@mohdraziuddin3922]

Seeing this video before exam day 😂😂😂😂😂

[@Pritamdaspk]

O(log n) leta ha na heapify?

[@rabiadar3050]

thanks my mids are going to be start from 12

[@TapanKPatra]

Subscribers bahut zaruri h..!!!

[@ahsanaliessani.4835]

Sir, one by one takes O(N) time as its name also highliting this and hepify takes O(logn)

[@shyamkamboj1983]

great explaine sir👋👋👋👋👋👋 time complexity aaj tak samaj nhi aayi thi.but after see viedo that is clear thanks

[@tasim6784]

Sir you are the best 🖤🖤.. i have Learn discreet mathematics through your youtube channel. i simply understand the topic after i watch the tutorial on your channel. Love from Bangladesh. 🇧🇩🖤🖤

[@sidraqueen5164]

Aslam o alikum Sir ,data warehousing ki series ki playlist nhi hai?

[@TasmimAkterFarin_20]

vaiya ji apne to mera final samval liye iss bar.. dhannebad.. greeting from Bangladesh

[@Princess-i7e]

I'm in examination center 🤣🤣

[@bulliraju5439]

Sir swapping and comparisons ek complexity pa rak diya Selection sort pa wo alag alag kiya tha

[@chitraaaaa]

Good going... :)

[@manassharma5499]

Very helpful video sir :)

[@zainazam7570]

special words (competitive exam, university and colleges)

[@monukumar-pm6yl]

Please complete the playlist

[@farazmalikofficial3137]

I really like your method and techniques of teaching sir💞

[@funnkidunyan1940]

Air ka SB sy mzy ka dialogue..... Q k subscribers bht zroori hain❤️❤️

[@flyingmachine6667]

Thanks Sir🙏❤

[@jxgjit]

You're a good man

[@shreyasiball2182]

U r such a gem❤️❤️

[@bismaabdulqadir7381]

kindly min tree ka b btaen aur insertion of specific number b bta den please

[@shaheer9262]

im watching this video while sitting in my datastructures lab

[@faltugaming6293]

10:08 mein logn+ logn=2logn =logn*2

[@baigbaigs2926]

Amazing xpalanation sir

[@takwirultayasur1944]

liked

[@AyeshaArshad-pc8yd]

you are so sososo great teacherr i am very impressed ❤️

[@Meeran2008]

You are absolutely right in saying that only books explain the contents you have covered here... and the clarity that you provide can not be easily grasped by going through the text in the books. Thanks for making this video and the one about how O(n) is achieved.

[@mhmitsme]

Handsome munda👀💖

[@Mr_suryvansh]

You are the best teacher bro❤

[@psc_youtuber]

Best explanation.

[@psc_youtuber]

Thank you sir

[@krishanudutta2943]

Excellent Explanation

[@redashehzadi5415]

Slamat rhy ameeen good job keep it up mashalla

[@akshaymeshram5699]

Subscribers nahi learner bahut jaruri hai🙃🙃

[@vanshikagupta6469]

Please make a video on threaded binary tree sir

[@Srishtiiiiiiiiiii]

Thanku great

[@danishmalik83]

You made the things so simple Great 😍😍😍

[@ayushkushwaha171]

very easy explanation, thanks man!

[@ambujacademy603]

and you are teaching very well all know