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.
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 😊😊😊
you deserve an award for being the best youtube teacher..... 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
Yes mam! If every node has black it can be red black tree And also check the number of black nodes when traverse in every path!! Thank you so much for the clear-cut explanation 😊❤
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.
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.
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...
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.
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
You are really best lecturer mom... you are work hard for the students.... I really like your teaching style and also I were understood all the things very well... thank you so much mam
This RB Trees topic is definitely one of the hardest lectures in any data structure classes. Seriously ... who thought up this crazy algorithm in the first place ?!!
Maam . Thanks a lot. This is very confusing topic for rotation but now everything is clear to me.( those having confusion just read gfg algo once then watch video u will surely perform well in exams)
After several hours of jumping from one youtube video to another in search for solid understanding in this topic, finally came across this. Keep up the good work!
Wow ma,am before watching this video red black tree was hard nut to crack for me but after watching this it's a peace of cake for me. Thanks again ma'am.
i started watching your videos because needed to get understanding on trees, but now i like to watch it because you're very beautiful. This reminds me of my childhood, having crush on the teacher. by the way i'm a working professional with 6 yrs of exp., just in case you're not married and is of similar age (i'm 2016 batch pass out btech) , then please do reply back. :)
Thanks for the amazing and deep explanation. No, It is not possible to have all black color nodes in a red black tree because, whatever we do, the last node must be red of the tree.
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.
your videos is like Marvel movies,if you not watch previous one then you can't understand the current video of series But I watch them one by one and learn.
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.
Kindly tell us which clg you prof at?
@@solsys8875 Chitkara University Punjab
@@ekanshgaming5854 no one is going to take admission in your college after this 😁
I know why you are take this lectures bcz🤣🤣
Prof.
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 😊😊😊
👌👌👌👌👌
No professor has those kind of double marker handling skills 😤
@@junmun5035 gatau aja lu binus
Our profs didnt explain at all lol
you deserve an award for being the best youtube teacher..... 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
it is one of the toughest section in the DS. ..
you worked extremely hard for this....quite evident from the video...🙏🙏🙏
Oh my gosh this explanation has made it so clear !!! I was struggling badly. Thank you x
Yes mam!
If every node has black it can be red black tree
And also check the number of black nodes when traverse in every path!!
Thank you so much for the clear-cut explanation 😊❤
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.
Thanks for this! I was a little confused in rule 4a. But this solved it
thanks
nice observation btw
broo u found the glitch in the matrix , thnks for the glitch :)
bro can u tell anything same for red black tree deletion :)
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.
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.
Wahh
In 4(b).......then recolour it and recheck...
You're so good at Data Structures, you can pass any interview - wow
Perfect lecture exist , Very much grateful , Go ahead with new new awsome lectures like this
Super. U r teaching very well. Before that I am totally confused. Now I am clear.
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...
This is actually amazing. I love how much work went into this video and how well everything was explained.
Mam the way you explained the red black tree is simply awesome
This channel is going to be a big name among online cs education channels.
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.
Can you share ur some imp. tips and instructions for mtech cs??
Did you get no job offer or did you want to pursue research? (Getting personal here XD)
My mind is blown. You've made it sooo easy. Absolute mad lad
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
are mam izzat bdd gyi meri nazron me apki is video ko dkhne ke baad
salute hai mam apko
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
jazakallah khair brother.
@@mohdsameer9214 wa iyyakum
thank u!
@@xxxx-xx4im you are welcome
Best Explanation of Red Black 🌲 on RUclips.
Your method of teaching is very good and understanding i very understand red black tree you insert data in my mind also
Tomorrow is my exam and if this question comes in my exam.I owe you my 7 Marks.Thank You for being my savior. ;-)
Thank you so much miss!
Your explanation is very precise.
I always watch your videos whenever I have doubts to clear my doubts.
The whole day I spent trying to understand this algorithm, and understood only after watching this video. Thank you so much.
I am so grateful for this video!!! This is the best explanation on red-black trees! Thank you!
Thanku Jenny mam...you are professor of Algorithm.
This is the simplest explanation of red black tree insertion, thank you so much!! ❤
Best Best Best......10000 explaination ma'am 🙏🙏🙏
thanks a lot mam , today is my exam and i was revising concepts early morning and your videos help me a lot in understanding data structures.❤😊
I go to college in NEW YORK and honestly i didnt understand this until watching your video. It was well explained. Thank you so much
Yes it is possible to have a red black tree with all nodes in black color.
Perfect teacher is not a myth anymore 🔥
best mam , what a fantastic way to make all things clear in a very simple way
Your channel got viral in our school :-D
Incredible !! the best
yes a red black tree with just root node that is black exists so red black tree with all black nodes is possible ...great explaination
You are really best lecturer mom... you are work hard for the students.... I really like your teaching style and also I were understood all the things very well... thank you so much mam
Kaafi sahi explanation tha boss! Great work!
Tq so much mam by this vedio I understood the red black trees concept very nicely tq mam
This RB Trees topic is definitely one of the hardest lectures in any data structure classes. Seriously ... who thought up this crazy algorithm in the first place ?!!
very elaborative explanation..got the full clarity of node insertion and rotations in this video..Thank you so much
You are the reason I got full marks in midterm exam Thank you so much mam...
It was such a wonderful explanation thank you so much mam 🎉🎉🎉
Explanation is Clear as day...aah I'm gonna pass this sem😌
this is the best explanation by far, thank youuuu
Maam . Thanks a lot. This is very confusing topic for rotation but now everything is clear to me.( those having confusion just read gfg algo once then watch video u will surely perform well in exams)
Very good lecture... Your patience is best...
Jenny you are among the best thanks for your effort
Thank you for doing such a long example. I finally understand it. :)
Wow mam what an explanation. Amazing, outstanding every word is less for your praise.
Yes it is possible to have all black nodes in Red black tree . Thank you for making the toughest topic easy for us
How
Because the last node u insert will always be red .......irrespective of any operations u do in above of tree
Just the root ⚫@@siddeshwarmadargave1403
Thank you ma'am you save my tomorrow's CT 🔥❤️
Thank you for putting so much efforts.
Thank you so much ma'am for such a clear & superb explanation. Before this i always in confusion, but now its so clear.
You are perfect lecturer , thank you Professor of Algorithms!
I really liked your teaching skill. please carry on :)
After several hours of jumping from one youtube video to another in search for solid understanding in this topic, finally came across this. Keep up the good work!
Great explanation. Thank you 🌹
Fantastic & Mindfulness Explantation👌👌👌👌
great effort mam you have explained it so easily that I learn it in a single attempt.
Many thanks from Germany! Very, very helpful! :)
Wow ma,am before watching this video red black tree was hard nut to crack for me but after watching this it's a peace of cake for me. Thanks again ma'am.
For a perfect BST a red black tree with all the nodes black colour is possible .....
Thank you mam for this lecture ❤
Pura semester nikal gya ab jake samjh aaya... Tq
27:15 *ANSWER is YES* We can have a Red-Black Tree with
*ALL BLACK* nodes.
Be oyy, kyar thi bhane 6e be? Kale exam 6ene Me haju hamna start karyu 😅😅
@@neelsoni8605 1 week thi *DAA* karta hta bro! 😍
@@saaagararts 🙏🏾
Yes bro you are Sagus
Yes, and that tree will also be a complete binary tree.
Very nice explanation. Thank you so much mem!
i started watching your videos because needed to get understanding on trees, but now i like to watch it because you're very beautiful. This reminds me of my childhood, having crush on the teacher. by the way i'm a working professional with 6 yrs of exp., just in case you're not married and is of similar age (i'm 2016 batch pass out btech) , then please do reply back. :)
made it clear in single attempt..thank you
yes it is possible , all black nodes in red black tree but it also have fully balanced binary search tree
Am happy for your new family member ❣
It is much more help full to me
For understanding this lession
Thank you
Thank you
So much mam
😊😊😊😊😊
Thankyou so much mam .. I am Doing BCA and your videos helped me to clear so many subjects . Lots of love to u 🤗🤗🤗🤗🤗🤗🤗 the best teacher
Thankq. Thankq thankq.. Alots of thanq maam.. Ur teaching way is very nice... Big fan.
Thank u mam it helps me alot ,in corona holidays I forget everything ,now it is very easy to learn by ur videos mam .
Thanks a lot mam, even after years this is helpful 😊
Best explanation of each step which helped us to understand it very clearly.
thank you for your great effort in extracting the step of rb tree insertion ,,it really helped me yesterday....
What a great explanation! Thank you very much
Thanks for sharing your knowledge and cute smile at the end of each video.
Toughest section from data structures but you are such a damn teacher 🙏😻
Bestest Lecture mam💯💯💯👍
Hii mam yesterday I completed ....my exam ....without leaving any question.....thank you....😍 u can teach better than our faculty...🙏🙏
congrats for the exam.. :)
Excellent detailed explanation, it is very helpful. Thank you for your efforts.
Tq for this video mam...
Answer for your question is YES in red black trees we have all nodes in black...
Amazing explanation.... Thankyou so much mam😊🙏🙏
Thank you very much. You are a genius. 👍👍🙏🙏👌👌🔝🔝
so easily explained ❤️😘😍💐🙏🏻🙇🏻♂️
Your lectures are simply awesome.....
Thanks for the amazing and deep explanation.
No, It is not possible to have all black color nodes in a red black tree because, whatever we do, the last node must be red of the tree.
Thank you so much, you explained it alot easier with the example and requirements to meet for a Red-Black Tree. Thanks for this video.
Beautifully explained❤
Oh my god!! Thank you so much.. you're such a saviour !!
It is very clear mam
Very Thankfull to u mam...
yes it is possible to have all black nodes in red black tree.
Tq so muchh mam amzing explanation mam
very nice . You cleared concept and all doubts of "Red Black " from this video.thank u
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.
your videos is like Marvel movies,if you not watch previous one then you can't understand the current video of series
But I watch them one by one and learn.
Amazing 👌🙌 bhutt easily pura process bhi yaad hogya