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
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.
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.
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
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 😊❤
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.
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...
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!
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
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)
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. :)
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 ?!!
hey Jenny, i am currently studying in Germany. The prof just showed the code and explained it quickly and we got confused a lot. Thank you alot to make this so simple. That helps mee alottt. And I am also happy that you are a woman in tech
You are amazing mam🥰earlier I have too much confusions in this topic but now it's very clear🥰, and you ask a question at the end of the video and here the answer.... "No" bcz every tree must have a leaf node and leaf of red black tree is always in red color😊
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.
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 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
Oh my gosh this explanation has made it so clear !!! I was struggling badly. Thank you x
it is one of the toughest section in the DS. ..
you worked extremely hard for this....quite evident from the video...🙏🙏🙏
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...
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 :)
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
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.
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 😊❤
You're so good at Data Structures, you can pass any interview - wow
This is actually amazing. I love how much work went into this video and how well everything was explained.
Perfect lecture exist , Very much grateful , Go ahead with new new awsome lectures like this
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
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)
I am so grateful for this video!!! This is the best explanation on red-black trees! Thank you!
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...
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!
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
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
Super. U r teaching very well. Before that I am totally confused. Now I am clear.
Thank you so much miss!
Your explanation is very precise.
I always watch your videos whenever I have doubts to clear my doubts.
Tomorrow is my exam and if this question comes in my exam.I owe you my 7 Marks.Thank You for being my savior. ;-)
My mind is blown. You've made it sooo easy. Absolute mad lad
Yes it is possible to have a red black tree with all nodes in black color.
Perfect teacher is not a myth anymore 🔥
This is the simplest explanation of red black tree insertion, thank you so much!! ❤
The whole day I spent trying to understand this algorithm, and understood only after watching this video. Thank you so much.
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.
Best Explanation of Red Black 🌲 on TH-cam.
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
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.❤😊
Best Best Best......10000 explaination ma'am 🙏🙏🙏
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)
Your method of teaching is very good and understanding i very understand red black tree you insert data in my mind also
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. :)
Thank you for doing such a long example. I finally understand it. :)
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.
You are perfect lecturer , thank you Professor of Algorithms!
Thank you so much ma'am for such a clear & superb explanation. Before this i always in confusion, but now its so clear.
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
best mam , what a fantastic way to make all things clear in a very simple way
Thanku Jenny mam...you are professor of Algorithm.
It was such a wonderful explanation thank you so much mam 🎉🎉🎉
It is much more help full to me
For understanding this lession
Thank you
Thank you
So much mam
😊😊😊😊😊
You are the reason I got full marks in midterm exam Thank you so much mam...
Wow mam what an explanation. Amazing, outstanding every word is less for your praise.
very elaborative explanation..got the full clarity of node insertion and rotations in this video..Thank you so much
Many thanks from Germany! Very, very helpful! :)
are mam izzat bdd gyi meri nazron me apki is video ko dkhne ke baad
salute hai mam apko
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 ?!!
Thank you so much for this, ma'am! Very thorough and clear explanation, covering all the cases. This really was great help for me.
Thank u mam it helps me alot ,in corona holidays I forget everything ,now it is very easy to learn by ur videos mam .
Incredible !! the best
hey Jenny, i am currently studying in Germany. The prof just showed the code and explained it quickly and we got confused a lot. Thank you alot to make this so simple. That helps mee alottt. And I am also happy that you are a woman in tech
Explanation is Clear as day...aah I'm gonna pass this sem😌
You are amazing mam🥰earlier I have too much confusions in this topic but now it's very clear🥰, and you ask a question at the end of the video and here the answer.... "No" bcz every tree must have a leaf node and leaf of red black tree is always in red color😊
Tq so much mam by this vedio I understood the red black trees concept very nicely tq mam
Very good lecture... Your patience is best...
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.
great effort mam you have explained it so easily that I learn it in a single attempt.
Hii mam yesterday I completed ....my exam ....without leaving any question.....thank you....😍 u can teach better than our faculty...🙏🙏
congrats for the exam.. :)
this is the best explanation by far, thank youuuu
Thank you ma'am you save my tomorrow's CT 🔥❤️
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.
so easily explained ❤️😘😍💐🙏🏻🙇🏻♂️
thank you for your great effort in extracting the step of rb tree insertion ,,it really helped me yesterday....
Amazing explanation.... Thankyou so much mam😊🙏🙏
I really appreciate this explanation, it's been super helpful. I was having a hard time, but now things make much more sense. Thanks a lot
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.
Fantastic & Mindfulness Explantation👌👌👌👌
Mam your explanation adds so much clarity that I cant express my gratitude towards you and mam You are proving to be a boon for us
Thank you very much. You are a genius. 👍👍🙏🙏👌👌🔝🔝
I am so grateful to you for this video. Thanks a lot!!☺☺☺
Great explanation. Thank you 🌹
Thanks a lot mam, even after years this is helpful 😊
For a perfect BST a red black tree with all the nodes black colour is possible .....
Thank you mam for this lecture ❤
Toughest section from data structures but you are such a damn teacher 🙏😻
Tq for this video mam...
Answer for your question is YES in red black trees we have all nodes in black...
Kaafi sahi explanation tha boss! Great work!
Jenny you are among the best thanks for your effort
Oh my god!! Thank you so much.. you're such a saviour !!
Thankq. Thankq thankq.. Alots of thanq maam.. Ur teaching way is very nice... Big fan.
Best explanation of each step which helped us to understand it very clearly.
very nice . You cleared concept and all doubts of "Red Black " from this video.thank u
Thank you for putting so much efforts.
Your channel got viral in our school :-D
Thank you so much Jenny with your help I got good marks in my exams, so thankful to you.
I really liked your teaching skill. please carry on :)
Truly my bottom of my heart love you so much mam and such a sweet explanation I think without you it's not easy to learn quickly
Excellent detailed explanation, it is very helpful. Thank you for your efforts.
Mam you are just Beauty with Brain 🧠❤️ thank you mam
Thank you for explaining this with so much patience. Hats off! Excellent :)
Every case is covered mam
Excellent work🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻❤️❤️❤️❤️❤️❤️❤️❤️
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
Thanks for sharing your knowledge and cute smile at the end of each video.
Absolutely love the way you make these difficult concepts easy and fun to understand! Heartfelt thanks to you Jenny ma'am!!
Thank you so much I cannot express my gratitude to your prefect explanation 🤍
you are great mam , my concept is cleared after watching this video .......very very very effective and efficient explanation mam
It is explained amazingly well without any confusion