Time complexity

#1

what is the time complexity of deleting any node from the heap

#2

hello @shashankmaheshwari054

To delete any random node. first we have to find it which is O(N) and then we have to delete it by using heapify which is log(n)
so in total it is O(N+ LOG N )

#3

after heapify the deletion will also take O(logn)

#4

once we have found the node that we want to delete then we need to bring it on the top of heap for that we need to use hepify up function which will take log(n) and after that we simply remove it from the top.

so the deletion complexity = time to found + time to bring it on top and delete
-> N + LOG N
-> o(N+ log N)

#5

but if we directly delete it from the top are heap will not get disturbed

#6

so we have to swap it with last index and then do down heapify

#7

yeah . . . . . . . .that is the procedure after bringing data(to be deleted) on the top

#8

so this process will aslo take O(log n)

#9

yeah , up and down heapfiy both takes o(logN)

#10

so the complexity should be=O(n+logn+logn)

#11

Yeah its the same thing
o(N + C * LOGN)-> o(N+LOGN) -> O(N) (IGNORED LOWER term)

#12

i think writing this O(n+logn) this is also correct in terms of big O notation

#13

yeah . . . . . . . . . . . .

#14

could u suggest me when to do leetcode should i start now only or after completing the whole course

#15

practice in parallel.
whatever topic u r learning from course ,practice it from leetcode(or any site that u prefer)

#16

for some guidance can you give your number or its not allowed here

#18

its showing no results found

#20

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.