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.
Bijaya Singh
Amrita Dutta
Hi Tushar, Your playlist on Tree algorithms is comprehensive. Wondering if you can add a video on B-Tree.
Nishtha Jain
Good Explanation Tushar Sir. Glad to have come across your channel.
Stéfanni Brasil
Thanks a lot, I always watch your lessons before my tests so I feel more confident. Cheers from Brazil =)
Nikhil Manali
bro hats off to u .You are the best ..
thanks sir ...awesome lecture ..almost cleared my concepts about insertions...
khupiya pandit
katae jahar bhaiya
aman gupta
kya bhai kaha pade ho , black height ki properties mai root la color nahi count karte😂😂
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.
Rathor Sahab
sirji indian excent me baat kyu nai krte ho. kya sharm aati h indian excent me baat krne me
raghav babbar
Vlad Brincoveanu
Thank you !
Shubham Saxena
Great lecture. simple and understandable!! :)
Druva Teja
Good explanation 👌
Nadiya Sri
Black Depth's are not satisfying in the above tree's
Levi Ackerman
Tushar is a life companion, a damn life savior
Jack Gao
This man
refayet salman
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 !!
Wei Huang
much appreciated! So inspiring!
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?
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
Arthur Fields
Wonderful explanation!
Cozma Cătălin
Noroc si sanatate , doamne ajuta !
Bhavya Sheth
Anuradha Siva
Tnq somuch
Shikha Sachdeva
Thanku sir
Elijah Einstein
I have my data structures final exam tomorrow morning !
Megan Lee
red-black tree corresponds to 2-3-4tree ,left leaning red black tree is equivalent of 2-3 tree
thai thay
Ritesh Singh
Great work sir
Yashdeep Sharma
Nice explaination sir
kalapala rahul
11:36 the tree is balanced,yet the rotation is done , thats weird...
God Bhai God
BC to to bhaag raha hai, easy bro
Rajeev Kavish
yeah , i understand rotation pattern very well but hold on ,could you please specify 2 nodes with which rotation takes place.......
Tim Guo
Very good explanation! Thanks.
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.
All India Ultimate FUN
Sir plz make more videos on algorithm
Chitrarth Tomar
The explanation is very good. But this tree is a bit racist(pun intended).
shilpi sharma
:* thnku  so much
Daljeet Singh
your videos are so clear & concise,wish you had been my data structure teacher...seriously great work man
Max Zhuang
Waleed Ejaz
phen nuu lun
Christopher Harsh
Thanks for this video. It was extremely clear and well illustrated.
sadhana samyuktha
It will be very helpful if it's bit slow
you're not human! thanks man really the best explanation I've seen so far
Levi Friley
You're a wonderful teacher and I thank you for your many videos
Patrick Garcia
does a red-block tree always balance??
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....
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
he looks like Satya Nadella but with hair
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.
Margub Khan
very nice explanation.. plz do a video for deletion....
Segue Diallo
nice video , but u forgot the condition of every red black should be transformable to a 2 4 tree
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 .....
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.
S. S
Subscribed. Insanely good data-structure tutorial algorithms
Captain 90's
Yash Srivastava
keep it up....bro ::::::::::::::::::::::::::
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?
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.
Azeem Hashmani
Really appreciate it !!! thnks man
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
Stephen Babb
Can you do a video on how to make a binary search tree?
Grid Sherman
This is the clearest and most complete explanation I've found. Well done.
Amith Adiraju
Excellent explanation !!!! BINGO !!
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
Lalit Singh Fauzdar
A great help for My tomorrow ADS exam.....Thank You for such a lucid explanation.....
Why are his eyes always half open?
Namesh Kher
Thank you once again !
thank you so much. Really helpful and the concept is very clear now. :)
Andrey Barkovskiy
I think, deletion in progress...?
Dipu Pandey
Great video....sir
Ambikesh Kumar Singh
nice sir u explained eveything ......thnk u
Vivek Mathur
thank you sir. very nicely explained
Awesome video!!! Really clear cut examples and good explanations at every step of algorithms! :)
Amit Sarkar
Thank you sir, its now cleared to me, this tutorial is the best
Mitrasree Deb
Great explaination _Thanks a lot ! :D (y)
Thanks for the awesome explanation bro! It helped a lot!
Kavita Rajawat
wonderful illustration. thanks
Henteti Ahmed
Thank you ;-)
yuvan manikandan
thanks a ton :) u r awesome..!!!!
alexandre decuq
Clear code, clear explanation bravo!
Karan Ramchandani
you are the best teacher when it comes to programming :)
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.
deepu thomas
Good job, made it very easy!
Mindaugas Graitavicius
You helped me a lot, thank you!
lostrainbow Yao
Really really helpful!
Challenge Accepted
go slower man you are damn too fast for learner
Mohit Gupta
dude.. you are awesome, we need teacher like you in our engineering college.
Pramod Singh
Great explanation, made it lot easier.
Uğur Uysal
Sanket Neema