5.17 Red Black Tree Insertion | Insertion Algorithm | Data Structure Tutorials

Explained how to do insertion in red black tree

******************************************
See Complete Playlists:

*************************************************

Connect & Contact Me:

#redblacktree #jennyslectures #dsa

[ekanshgaming]

I am a professor in CSE deptt. But, I learnt almost every lecture of Data structure from your channel and then get a confidence to teach my students. Keep it up. God Bless you. Certainly, u shall reach the height.

[atdinfinity]

No teacher taught Red black tree by actually using Red and black markers which made it difficult to understand.
You did it neatly and your explanation adds clarity. Thank you for this video ma'am 😊😊😊

[mahlomolamohlomi]

you deserve an award for being the best youtube i was struggling with this concept ..now i guess i'm going to past with test on monday...thank you so much..keep on doing the good job

[londonstudioliving]

Oh my gosh this explanation has made it so clear !!! I was struggling badly. Thank you x

[roushansingh]

it is one of the toughest section in the DS. ..
you worked extremely hard for this....quite evident from the video...🙏🙏🙏

[dhairya-varshney]

Point to remember: If rotation is LL or RR, then GP and P node will be recolored, if rotation is RL or LR then GP and Child node is recolored.
GP means grand Parent, P means Parent.

[sohamshinde]

Ma'am you taught it very nicely. Also your algorithm is very helpful, but I would like to have some edits as follows :






1)    If tree is empty, create newnode as root node
with colour Black.

2)    If tree is not empty, create newnode as leaf
node with colour Red.

3)    If parent of newnode is Black then
exit.

4)    If parent of newnode is Red, then check the colour of parent’s sibling
of newnode:

a)     If colour is Black or NULL
then do suitable rotation among node, parent and grandparent and then recolour
the parent and grandparent.

b)    If colour is Red then recolour the parent and parent’s sibling and
also check if grandparent of newnode is not root node then recolour if and
recheck from the grandparent.

[sillytech]

When i did my BTECH i used to watch our videos and now doing Mtech still watch your videos....most of the youtuber take easy examples where there is no confusions and diffcult scenarios that a student might face but you take the examples considering all the scenarios and explain...Thank you for your efforts.

[hassanelnaggar]

Here are the algorithm notes written on the board:

1. If tree is empty, create newnode as rootnode with color Black
2. If tree is not empty, create newnode as leaf node with color Red
3. If parent of newnode is Black then exit
4. If parent of newnode is Red, then check the color of parent’s sibling of newnode:
(a) If color is Black or null then do suitable rotation and recolor (such that the root of the subtree is Black and children are Red)
(b) If color is Red then recolor (parent and parent’s sibling) and also check if parent’s parent of newnode is not rootnode then recolor and recheck

rules:
-> root color = Black
-> no two adjacent Red nodes
-> count of Black nodes in each path is equal

[swortkeiser]

This is actually amazing. I love how much work went into this video and how well everything was explained.

[JyotiSharma-wbvy]

Just wow!! Very well explained. Everytime when i have to study any topic i just simply write topic name and then by Jenny. You are my first priority.

[Black-xypj]

I am so grateful for this video!!! This is the best explanation on red-black trees! Thank you!

[azeemushanali]

Tomorrow is my exam and if this question comes in my exam.I owe you my 7 Marks.Thank You for being my savior. ;-)

[fahmidalrifat]

Perfect lecture exist, Very much grateful, Go ahead with new new awsome lectures like this

[zainuddin]

Yes, Every node in Red Black tree can be black, but i guess the tree must be perfectly balanced so that there will be same number of black nodes in each path.

[HornOKPlease]

You're so good at Data Structures, you can pass any interview - wow

[fahmidalrifat]

Your video cover all deep concepts of the topic, That helps a lot ...hard topic become water like ...Thanks a lot for every thing mam <3

[anasbari]

Never Seen Such An Amazing content 💯.My Professor should also come here before proceeding to the class 😂. 27 minutes kab nikal gaye pata hi nahi chala...

[willturner]

Your channel got viral in our school :-D

[furrypuppy]

Thank you so much miss!
Your explanation is very precise.
I always watch your videos whenever I have doubts to clear my doubts.