Видео

Thanks!!!

Very well explained, I do also think like others have commented that this is the only video which explains this concept well. Thank you @Uzair for the efforts of preparing and presenting the content in an solid way.

I never comment .. but man this time I must say .. best explanation till now .. universities needs teachers like you

at first, thank you for a wonderful playlist, good selection of topics which are usually left aside & very good presentations.. I'm just on the 3 topic & the most interesting stuff is still ahead! on this video I think there should be a correction around 30:30 = I think there's no issue with two (or more) black nodes in a row, but it's not a problem, because it makes the total height of the tree even closer to the black height, and the black height is something that we have under control as is shown by your preceding inductive argument, so it doesn't affect the whole argument for RB trees being balanced in general~ big hello from Moscow, definitely watching this playlist till the end!

good one good explanation

Why are the costs of TC1 O(n^2), when you multipop all n 1? wouldn't it be just one opertation of O(n), where the costs are O(1) for the whole stack? why multiply O(n) x n? Great video btw!

Best explanation sir 🎉

Just a small error I think for merge 30 with child 20 is taken ...that doesnt follow min heap property..

thx bro

thank you so much sir!! you saved me from failing my exam 🙏🙏🙏🙏 very great explanation btw!

Thanku sir for such a content

Finding minimum - Binomial Heap - O(log n). since there are no pointer to direct the minimum, Insert also same as finding minimum.

thanks man 🤜🤛

Thank you a lot for posting this! It is helping me a lot to deal with complicated subjects like this one, and I'm sure it will continue helping a lot of people

The only thing i can say about this video is never stop teaching because you are one of the definition of teaching.

Is trie and Standard trie both are same ? If not what is the difference ?

Amazing explanation. Exam in 3 days (wish me luck) you are a life saviour!! Thank you!

Sir, what an explanation! Now I have Ford Fulkerson algo at the tip of my fingers. 😊🤌

This was top notch teaching! I used these this video and the last one as references and test cases for my own implementation in Go and worked like a charm!! Thanks be to Uzair for his patience and intellectual generosity!

Very great teaching thankyou sir ❤

37:20 I believe node 7 was not meant to be deleted when the DB node (5) resolved to a single black node.

Thank you so Much🥰🥰🥰🥰🥰

Thankkk You :)

sir in our slides it says that first insert has amortized cost = 2 rest 3, can you elaborate on this?

Okay

How can there be a tree with no external nodes?

Thanks a lot 🙏

Amortized Analysis Aysmptotic Notation - Big O Notation , Big Theta Notation Why amortized analysis is more important than asymptotic notation in some cases An example Augmented Stack

best explanation ever... keep doing please and a big thanks to you finally I'm able to understand in a systematic way

I believe this is the only RUclips video where this algo is explained in such a clean, clear, systematic and understandable way. You have explained all the minute things so convincingly. Finally, I am able to understand. Thanks.

Wow very nice explanation!!!

Sir, mujhe ab samaj aaya kafi Sari video dekh kar 🙏 Thanks a lot sir .

Your content is excellent, my advice is to please don't concentrate much on views. This is the future content.

You are awesome!!!!

Good explanation

Just one thing, please fix this camera thing, the focus is a little unstable and annoying.

Thanks for the spoon-feeding. It means a lot. You explain really well. I could not have done my DSA assignments without you.

Is there a PDF of these rules to download anywhere? These are great!

Tommorw i have exam!! And i found this video after struggling so much..... Superb explanation sir, Thank you so much 🙏

Thanks a lot ,couldn’t find any vids for this topic but u saved and made my day

Nice explanation sir, thanks a lot

just switch on mono audio both earphones will work

Thank you so much sir, the explanations you give are detailed and you ensure that the information is understood. Thanks for explaining this topic since there are very few videos on it.

We can't delete in bloom filter because it will increase probability of false negative rate which was zero before.

Thank you! Please continue to upload.

Thank you for this video! Please continue uploading.

You are a great teacher

In the delete operation, when we performed decrease key to 2, shouldn't we also cut 39, add to root list and unmark the node?

Great explanation