omg thank you I was going crazy at all the videos and lectures saying "if we delete a red node, we just delete it and then there's nothing to do" when you actually still have to color the replacement node red if it is not already. That is not "doing nothing" lol
For example 8 to be case 4, x would have to be black (true), w would have to be black (true), and if x is the right child, w's left child must be red (false). In example 8, since x is the right child and w's right child is red and w's left child is black, this would fall under case 3.
omg thank you I was going crazy at all the videos and lectures saying "if we delete a red node, we just delete it and then there's nothing to do" when you actually still have to color the replacement node red if it is not already. That is not "doing nothing" lol
Fantastic examples! Finally, really algorithmic approach with clarity and full details. Thank you very much!
Thank you very much! Best explanation!
Best explanations I've ever seen! Thank you!
The best explainer out there.
Your explanation is so great!
Thank you very much for the explanation its easy to understand
I just wanted examples, thank you for this
Thank you
amazing vedio
Thank u so much❤
Make more videos like this
isnt example 8 case 4?
For example 8 to be case 4, x would have to be black (true), w would have to be black (true), and if x is the right child, w's left child must be red (false). In example 8, since x is the right child and w's right child is red and w's left child is black, this would fall under case 3.