L-3.12: Deletion in Heap tree | Time complexity

preview_player
Показать описание

►Design and Analysis of algorithms (DAA) (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Computer Architecture (Complete Playlist):
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Рекомендации по теме
Комментарии
Автор

Although I don't like commenting just like others in comment section but sir you are the one who has actually made the college life easy to survive. The constant answer to " tu exams k liye khan se pdhegi " arrey gate smashers h na...

gayatri
Автор

I hope you read this comment... If I clear GATE with a good score, I would dedicate at least 90% of my success to you. Thank you very much for all of your videos @GateSmashers

purnima
Автор

Easily understood video.thank you sir❤️❤️👍

faizgujaratigamer
Автор

These videos are in continuous manner related to GATE 2022 or not ???

creaturetrendy
Автор

Sir how can we solve our doubts in the questions of asymptomatic notations and recurrence relations you have given for practice in Gate 2022???

sargamgupta
Автор

It was informative, no doubt, but I enjoyed the FUN Elements too :),

TheMR-
Автор

Can you tell me while deletion of heap tree qstn why you didn't put 7 on the top instead of 6?

PremKumar-bujc
Автор

Sir. Please CPM and PERT k topic p b video bnay

ch.alishahzad
Автор

may god bless you sir you are helping us a lot.

tameshwarisahu
Автор

Sir agar root ko delete kardiya to lowest level right most element 6 kaise hua? 6 to lowest level e leftmost element hain.. Sir please explain.. I am little bit confused about this

saidulsk
Автор

Mondii
😆hata de kaya? What language 😆

GlamPanda
Автор

Thank you sir, aapka explanation always best hota hai😊

debaratighatak
Автор

Sir please tell me if just want to delete 2 then what will be the procedure
Means if we want to delete middle element then what eill we do?.

point_to_think
Автор

I am here 2023 dec sem 3 in bca ryt 2 days before exam ❤

suryanshsingh
Автор

You are so amazing sir.
Apke videos are lifeline to us.

lj-gd
Автор

Can we delete specific element other than root node in heap tree

everythingexist
Автор

Nicely explained by Sir❤❤❤

My doubt is for one element, time complexity is log n but for n elements, how come it is n*logn
It should have been lower since if we delete that node, n also decreases and so the height in proportionate manner

dvoorganisation
Автор

Why should we swap with smaller of the two children? In this case, swapping 6 with 3 also maintains heap property right.

pushparajinjeti
Автор

Thank for uploading video of each and every topic.

psc_youtuber
Автор

Mundi hta diii ...😂😂😂😂😂😂😂😂 Love you brother from Ghaziabad

internetmaster