3.1 What are Red Black Trees? | Advanced Data Structures| Complete Introduction & Properties 

It's great to see people teach those topics whose resources are not much available ......you got a subscriber bro😄

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!

the best .please don't stop uploading.

Hope You will get more views and appreciation for your work Great Content 🙌🙌

Thnx for covering advanced data structures..not much reliable content available on youtube...💙

Thank you so much sir. Underrated videos>>>>

Sir your lectures are very helpfull for me . But your camera is constantly refocusing which is a bit disturbing