Red Black Tree Insertion

Download videos:
hd720 medium

How to do insertion in red black tree. /> />

Mohit K
I am listening up this lecture at midnight and it is so interesting that I can't sleep
Viraj Singh
Time to take revenge from my DAA teacher.
Deep Basu
India has got the talent.
Annujj Agrawaal
Tushar Roy! Hats off man ........u take great efforts in covering every concept for each topic! I just have to look up for ur videos before my exams and I am done :-)
Cherry Pauper
14:51 is where it gets EXTREMELY confusing.
Stéfanni Brasil
Thanks a lot, I always watch your lessons before my tests so I feel more confident. Cheers from Brazil =)
khupiya pandit
katae jahar bhaiya
Nishtha Jain
Good Explanation Tushar Sir. Glad to have come across your channel.
Amrita Dutta
Hi Tushar, Your playlist on Tree algorithms is comprehensive. Wondering if you can add a video on B-Tree.
Nikhil Manali
bro hats off to u .You are the best ..
Bijaya Singh
There is a little mistake in ur algo if (parents parent is root ) no recolour u missed no here pls check it and if i m wrong tell me
anand kumar
Nobody has elaborated and embellished RB tree with this perfection. Thanks man!!
Pragya Patel
LOL!!! at 2.23 ,That 2nd tree is not a red Black tree 'cos the number of black nodes in the last sub tree is 3 not 2.
Vlad Brincoveanu
Thank you !
raghav babbar
Shubham Saxena
Great lecture. simple and understandable!! :)
Anuradha Siva
Tnq somuch
Amit kumar
Thank u for this lecture. RB tree is one of the most complex data structure in my course and you made it much easier to understand. Thanks again !!
pioneer sharma
Hi Tushar, Thanks for your wonderful videos. I watched AVL and Red black tree videos. In both AVL and Red black tree is rotation part is different or same? In AVL you showed the following: (a) LL: Right rotation. (b) LR: First left rotation then right rotation. (c) RR: Left rotation (d) RL: First right rotation then left rotation. In Red black tree, you showed the following: (a) LL: Right rotation. (b) LR: First right rotation then left rotation. (c) RR: Left rotation (d) RL: First left rotation then right rotation. Can you put your comments on this?
aman gupta
kya bhai kaha pade ho , black height ki properties mai root la color nahi count karte😂😂
Elijah Einstein
I have my data structures final exam tomorrow morning !
Shikha Sachdeva
Thanku sir
Anand Zutshi
Thank you so much for this video. I loved it. I have a knack for data structures; especially trees. I would love to learn more about advanced data structures, and their optimised solutions by designing new data structures. Could you please give me some advice as to where should I start in order for ds design and implementation? Are their any projects for it? Thanks in advance
God Bhai God
BC to to bhaag raha hai, easy bro
thai thay
Madhvi Bansal
Wow . I didn't understand this topic from my teacher but listening this lecture all the cases would clear . Thnk u sir for making this video.
Megan Lee
red-black tree corresponds to 2-3-4tree ,left leaning red black tree is equivalent of 2-3 tree
mita Rani
Well explained . I try read nd understand from book but it didn't help me out .. but this video makes me to understand well....
Daljeet Singh
your videos are so clear & concise,wish you had been my data structure teacher...seriously great work man
All India Ultimate FUN
Sir plz make more videos on algorithm
Patrick Garcia
does a red-block tree always balance??
Christopher Harsh
Thanks for this video. It was extremely clear and well illustrated.
Arthur Fields
Wonderful explanation!
Waleed Ejaz
phen nuu lun
Tim Guo
Very good explanation! Thanks.
Shout in the void
he looks like Satya Nadella but with hair
Rajeev Kavish
yeah , i understand rotation pattern very well but hold on ,could you please specify 2 nodes with which rotation takes place.......
Ritesh Singh
Great work sir
Levi Friley
You're a wonderful teacher and I thank you for your many videos
Yashdeep Sharma
Nice explaination sir
Chitrarth Tomar
The explanation is very good. But this tree is a bit racist(pun intended).
Why are his eyes always half open?
sadhana samyuktha
It will be very helpful if it's bit slow
j karthik
Thank you so much for making videos on DS and Algos and making developers life simple. I use to spend more time in understanding Algos but after your watching your videos my preparation moved faster... And great explanation .....
Shubham ruwasia
thank you mr. tushar roy you explained red black tree very well, I'am completely satisfied with your explanatio, good going, guys subscribe and keep learing
Max Zhuang
shilpi sharma
:* thnku  so much
Sourav Mohanty
Hi Tushar! Your videos are the best. Please upload some tutorials on Maximum flow Algorithms. And keep up the awesome work you are doing. :D Thanks in advance.
Benjamin Rood
Thanks Tushar! Very, very clear and simple explanation, when there are so many poor ones out there in textbooks or ones which just hand-wave the deletion algorithm. One small quibble: @30:59 your second bullet point could be "For all distinct paths p in our tree, the sum of black nodes in the path sequence of p from a node x to any leaf l must be identical" - but really, even in that sentence, as with the writing of your bullet point, the word should be ANY rather than ALL (knowing that the logical symbol of "for all" is also "for any"). In other words, it should be "same number of black nodes in ANY path (from a node x to some leaf l)". Super subtle, but it might be worth a subtitle on the video which clarifies it.
thank you so much. Really helpful and the concept is very clear now. :)
Akarsh Srivastava
keep it up....bro ::::::::::::::::::::::::::
you're not human! thanks man really the best explanation I've seen so far
arun satyarth
Hi Tushar, Much thanks for your videos. They say a teacher shows the path to god!! Thanks to you many are walking on that path.
Amit Sarkar
Thank you sir, its now cleared to me, this tutorial is the best
Ambikesh Kumar Singh
nice sir u explained eveything ......thnk u
Awesome video!!! Really clear cut examples and good explanations at every step of algorithms! :)
Mohit Gupta
dude.. you are awesome, we need teacher like you in our engineering college.
Goutam Kumar
Hi Tushar, just a small question, is rightRotate function , before the changeColor condition, you are checking for null case of right node, but in your code of github it will never be null instead it will be empty node with isNullLeaf = true, hence it will always assign parent. Anyways no harm in doing that, just to tell, I think its redundant
S. S
Subscribed. Insanely good data-structure tutorial algorithms
sachin tichkule
Sincere thanks for explaining the concepts clearly , but one humble request , if i am not correct please apologize , i am not able to follow ur pace , feeling it little bit faster , but if can slow ur pace of explaining little bit , it will help lot of beginners like me and help us to understand concepts clearly.
Mitrasree Deb
Great explaination _Thanks a lot ! :D (y)
Karan Ramchandani
you are the best teacher when it comes to programming :)
Grid Sherman
This is the clearest and most complete explanation I've found. Well done.
alexandre decuq
Clear code, clear explanation bravo!
Segue Diallo
nice video , but u forgot the condition of every red black should be transformable to a 2 4 tree
sakya basak
Thanks Tushar ........these videos are among the best that is available online...... Can you plz give a video even for tries/ sufffix tree?Thanks in advance
yuvan manikandan
thanks a ton :) u r awesome..!!!!
Vivek Mathur
thank you sir. very nicely explained
Azeem Hashmani
Really appreciate it !!! thnks man
hi, thanks for the video. Really helpful. I did not hear you mention as CLRS that to analyze case 1, case2 or case3 during insert new node. The program on board is following that, or it is a different program or process?
Gimhani Uthpala
really good explanation. thank you very much. looking more videos related to data structures.
Sharique Mohd
Thank you for such awesome vids. It would be great if you could mention some problems on various OJs related the topics that you teach.
Pramod Singh
Great explanation, made it lot easier.
Margub Khan
very nice explanation.. plz do a video for deletion....
lavanya devarasetty
It's Soo interesting the people who doesn't know abt dis topic can easily understand I m.very happy vd did lecture .and I need even for splay trees
deepu thomas
Good job, made it very easy!
Challenge Accepted
go slower man you are damn too fast for learner
balaji baskaran
Thanks for all your efforts. Very clear and good explanation. Appreciate it!
Stephen Babb
Can you do a video on how to make a binary search tree?
Kavita Rajawat
wonderful illustration. thanks
jason knox
I really like your mission Tushar, thank you for helping me. I always spend a moment envisioning how you are personally creating a sense of peace by helping others even in an environment of competition. Very inspiring brother!
Shravan Dwarka
if parent is red and sibling is absent, recolor what? the parent or the new node?
Captain 90's
Michael Spagon
Thanks Tushar! You helped me cram for my Algorithms class!
Lalit Singh Fauzdar
A great help for My tomorrow ADS exam.....Thank You for such a lucid explanation.....
Andrey Barkovskiy
I think, deletion in progress...?
Mindaugas Graitavicius
You helped me a lot, thank you!
Aparichit Singh
hello sir ! i have a doubt in the lecture you have mentioned that there can be atmost 1 type of rotations but in the example(insertion) at time of inserting 60 we have to do 2 rotations ! Am i missing something ? please help ! And once again great video and thanks a lot :)
Yoyo Cob
gj, thx a lot!
Tarun Bhola
Omg. Can you be a bit slow. I cannot catch up with you. Damn.
Namesh Kher
Thank you once again !
Alok Gaur
bhai pehle thoda path acche se bolo
Dipu Pandey
Great video....sir
Henteti Ahmed
Thank you ;-)
lostrainbow Yao
Really really helpful!
thanks Tushar Roy for all these amazing videos to teach us concepts quickly.
Karol Nadratowski
Thank you so much for this video, it helped me a lot :)
Thanks for the awesome explanation bro! It helped a lot!
Anirban Saha
Very helpful video 😊