5.16 Red Black tree | Introduction to Red Black trees | DSA Tutorials

[@83vbond]

I am studying IT in Australia currently. This is the first video I found on Red-Black trees where I actually understood the topic because you start from the basics and give lots of examples. Thanks and gratitude from Australia! Also, the last question tree is not Red-Black because the left NIL child of 15-node creates a black path that is of different length. Very good question, makes a person think deeply. Keep up the great work!

[@asadkamal89]

Can u please sponsor me for australian study visa???

[@learncodeandphotoshop2328]

hey, hi did you find a job? what your linkedin?

[@hemanshuwaghmare7460]

bro kya faida Australia me padke chii bhai isse aacha tu india ke sarkari school me pad leta😂 paisa barbad!!!

[@rkhumorist1341]

@@asadkamal89 yes i can sponsor you!!

[@SudhirKumar-w5n4t]

Hi bro

[@kdoxfkck]

Seriously.....you are too good at teaching....I rarely appreciate people....but u deserve not only appreciation but also a heart❤️❤️... Thankyou so much ma'am for your precious teaching...🙏🙏

[@AdityaPandey-ns8kl]

Videos like these make going to college absolutely unnecessary. Stupendous work!

[@eddyecho]

This is only true for people that already know exactly what to study to learn what they want to learn. Otherwise I can't see how someone who has no prior knowledge would even know to search for this video or have any appreciation for it. I suppose someone could read an introductory textbook but most people don't do that.

[@yeswhynot319]

@@eddyecho syllabus is a thing lol

[@vikas420mudimela9]

The most intelligent approach that i have never seen in my academic year

[@ayushpaine5650]

Galat college main padhrae tu

[@abs80900]

In all the languages spoken on earth, THANK YOU SO SO SO MUCH!!!!!!

[@anuragtiwari2511]

dont know someone said this to you or not but, i would say best explanation ever heard....Appreciations:)

[@chrischauhan1649]

This is one of the best explanation of the Red-Black tree on the internet. Kudos to you.

[@gabriellaryanie7342]

I really love your videos since I have just started 2nd semester and is starting to learn data structure. Your videos have helped me finish my homework, recommended!

[@34_harshdeepraghuwanshi98]

Where do you live?? India

[@RISHABH-VERMA]

Woah, you studying red black trees in 2nd sem ?

[@Gyaani-p8w]

@@RISHABH-VERMA mera to 1st sem hai 😀

[@RISHABH-VERMA]

@@Gyaani-p8w Nice, I'm in PG

[@muhammadmuneeb1125]

Thanks a lot Mam, I am from Pakistan you are too much hard-working lady. May Allah bless you with your dreams Again Thanks a lot mam

[@Nitishkumar-rd4jq]

India needs these kind of people for educating other's for free of cost

[@andrew2jaramillo]

I don't understand how ppl can give her a negative review. This is so good!!

[@alekyaathaluri5123]

no one here gave negative review

[@ashu7pathak]

Awesome lesson, as answer to your question @ 32:43, it's not following 4th property as there is a left NIL node of 15 having only 1 Black node from root to NIL leaf node, all others have 2!

[@factwithhunny078]

Bro it is not complete binaray tree

[@smokersmoker2529]

finally i found answer in comment section tq.......😇

[@a.m.4154]

If you're following the DSA textbook by Goodrich, Goldwasser, and Tamassia, the violated property is also called the depth property ('ALL nodes with zero or one children have the same black depth whereby a black node counts as it's own ancestor') which is violated by node with key 15.

[@nonstopcodingcodewithadity8238]

tho kare kya fir ? @@a.m.4154

[@Priya_happyface]

Aap bahut acha insaan ho Aise hi hmari help krti rehna mam Phir jab job mil jayega to aapse Milne aaungi

[@JennyslecturesCSIT]

promise kro ki milne aaoge.... hehehe

[@Priya_happyface]

@@JennyslecturesCSIT promise mam

[@harshjha5304]

@Md Aman job lagalo pehle :)

[@unboxing9416]

@@JennyslecturesCSIT hehe

[@amanmaddhesiya566]

The way u explain is very nice Keep it up mam

[@jacksentalksjst7014]

as i am studying in germany here i found first video to clear all my doubts. thankyou so much mam.

[@vjayasinghe8695]

thankyou so many more.. i searched lots of videos about red black trees.. but i couldn't find any of video to touch my brain..this is the only one..thankyou so much.😍😘

[@Burak-cr6um]

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!

[@a_sunshine_21]

One of the best explained contents. Not only datastructre ,each and every video of urs. Best out of all. ❤

[@poojatiwari7043]

Last property is being violated. ...thank u so much mam for this lecture

[@patils22]

Hello mam, The BST is not a Red - Black Tree, since the path 10 - 15 - Nil has only 1 black node, whereas all other paths have 2 black nodes.

[@TheAbsoluteSir]

Can you give me a timestamp for the tree you are referencing?

[@onkarhalder4660]

@@TheAbsoluteSir 32.47

[@AkhilPulidindi]

@@TheAbsoluteSir mam asked the question whether the tree is red black tree or not. She said to type answer in comments at 32:40

[@aydendarian1785]

i know Im asking the wrong place but does anyone know of a way to get back into an Instagram account?? I was stupid forgot the login password. I would appreciate any help you can offer me

[@sofiaabbasi2404]

@@aydendarian1785 change password

[@studyonline3236]

lecture starts at 8:21 and 11:50

[@dineshbs6635]

Insertion in AVL tree takes a maximum of 2 rotations. Deletion can many rotations. Hence, Red Black trees are used if insertion & deletion operations are very frequent

[@raginirajpoot2711]

Thanks a lot Ma'am. You are amazing 🤩🤩🤩 Just Because of you I understood Data Structure last year .... And now finally I found your videos about DAA... 😁😁

[@ayushpaine5650]

Abe pucha kisne

[@raginirajpoot2711]

@@ayushpaine5650 saaale teri esi ki tesi........kyu bhonk rha he be.......mirgi ke dore to na pd rhe tereko.....saale chle aave muh uthake .,..🤬🤬🤬😡😡😡😡

[@AbhishekSingh-sy9ze]

I was unable to explain this topic in Geeks for Geeks interview, although I am good at competitive programming. But you explanation is quite good. I knew the concept already but now I can explain it to anyone. Thanks a lot ! (I wish you were my teacher, so pretty) .

[@Amira20234]

Really Great Lecture.. Not found this much information any where,, Many thanks from Germany

[@ashu7pathak]

14:06 - Head of family, like grand parents do yoga and always remain calm. Therefore, root's always black :D

[@amritpalsingh7262]

Thank you very much mam, i was waiting for this lecture especially from u n finally it's here. And getting to ur question, this not a RB tree, bcoz it's violating the last condition i.e. the no. of black trees are not same.

[@sujathaganesna9604]

I am listening to my online classes from 1week on topic red black tree...but this 30 min video helped a lot to understand....tq so much mam ...❤️

[@vaibhavgarg4267]

Great Explanation. You make complex topics easier. Awesome way of teaching :)

[@mbm662]

Thank you ma'am for the best explanation ❤ . Yours teaching classes are very helpful for engineering students 🙏

[@saaagararts]

32:45 It os *NOT* Red-Black tree. Because it is voilation property of every path has same Black Nodes. (At node 15 path is having only 1 Red Tree).

[@satya8411]

Shortcut: If a red node exists it shouldn't have a single child It should always have 0 children or 2 children

[@ashu7pathak]

@@satya8411 I agree!

[@sagar104gurgaon]

www.geeksforgeeks.org/red-black-tree-set-1-introduction-2/ please go thru it.

[@chinmaywalinjkar7340]

this is the wrong answer pls don't misguide

[@mrwlf4840]

@Satya

[@simple_hiddencomputer_tric9579]

Beauty and wisdom in one person ..bravo!

[@newsanalysis4831]

kzbin.info/www/bejne/apmlZ2CXbatsj9k

[@jithunniks]

You really have an exceptional ability to explain.

[@a-064ramakantchhangani4]

The node with value 15 has no left child and total number of black nodes to the path 15 -> NIL is 0 while to the path 15 -> 25 -> 20 -> NIL is 1 and such further paths . So , not a red black tree.

[@mrThundergodpro]

Bro we know nil node also a black node so we count that node so it is red black tree

[@qazidawood995]

@@mrThundergodpro nill is a black bit that is one extra for each... I think ta makant has a valid point.. Its not a rbt

[@shaankhaan1686]

@@mrThundergodpro yes but if this u consider than every path has one nil leaf so then total no of black in each path is not same bro😀

[@vasusuryavamsham4882]

15 has another left nil node which makes a path from 10 with only 2 black nodes so it is not red black tree

[@utkarshsingh5084]

Sir aap idhar 🦧🦧🦧

[@sirishagolla9631]

Iam not understand English properly but your speaking iam easily understood you have awesome English skills mam ❤️

[@crickeditzz]

00:02 Red black tree is a balanced binary search tree 02:22 Binary search trees follow the property of left subtree having values less than the node and the right subtree containing values greater than the node. 07:39 Red Black trees ensure balanced trees with fewer rotations 10:09 Red black trees offer efficient time complexity for search, insertion, and deletion operations. 15:20 Red Black trees have specific rules for node colors and relationships 17:54 Red Black tree should have equal black nodes on all paths 22:41 Root should be black in a red-black tree 25:01 Red black trees are perfect binary trees with additional properties 29:24 Red Black tree property: longest path from root is no more than twice the length of the shortest path. 32:02 Red Black tree insertion logic

[@hamzaanwar7204]

Ma'am the way of ur teaching is just mindblowing😇

[@mukul4243]

Answer of question asked in video - No it is not a red black tree because it is voilating the condition i.e every path has same number of black nodes ....(here after 15 there should be a black node to make it a red black tree) Thank you mam.

[@chirag4783]

1 crore

[@Laloloop]

I feel like an expert in red-black trees now haha, and I’ve never read anything for more than 2 mins about it. So, the last example is not a red-black tree, because in the right side you have a path to a nil with only one black node, and the others have 2 black nodes. Still a little bit confused on usages, although the properties of self balancing are pretty cool, I guess that’s what the red or black abstraction is for. Thank you! Keep up the good work!

[@chocolaty_gurl]

No bro in right side also 2 B nodes one is root that is always black

[@vishnu88-o1x]

After watching your videos definately I am big fan of you.thanks for your teaching

[@0neAboveAll]

I should pay my tution fees to you instead of my college. U are a great teacher Mam.

[@nigarsultana1739]

Definitely a great lecture mam. I am very beginner but I understood your videos completely. Thank you so much mam.

[@Binks135]

00:02 Red black tree is a balanced binary search tree 02:22 Binary search trees follow the property of left subtree having values less than the node and the right subtree containing values greater than the node. 07:39 Red Black trees ensure balanced trees with fewer rotations 10:09 Red black trees offer efficient time complexity for search, insertion, and deletion operations. 15:20 Red Black trees have specific rules for node colors and relationships 17:54 Red Black tree should have equal black nodes on all paths 22:41 Root should be black in a red-black tree 25:01 Red black trees are perfect binary trees with additional properties 29:24 Red Black tree property: longest path from root is no more than twice the length of the shortest path. 32:02 Red Black tree insertion logic Crafted by Merlin AI.

[@zinanzine7674]

I came here to for a research, ended up admiring Indian teachers.

[@hAsH_learn2code]

Not all indian teachers are same, she is extraordinary

[@geekeansh6900]

Mam I m so much thankful to you I m in btech 3rd yr I was facing real issues understanding DAA now I m able to get cover all topics I m will definitely meet you after being independent and gift you with my own income thanks alot and really you are beautiful and my crush too haha 😇😇😇😍

[@mystmuffin3600]

glad I scrolled down

[@sahilgaikwad2002]

Mam you are amazing I have lot confusion about red black tree. After watching this video that confusion is gone 😃 thank you mam🙏❤️😊

[@stephenhowe4107]

20:53: Jenny introduces a 12 node to black path count is 2. But without introducing a node, make 15 black, 20 red. It becomes a red-black tree and all paths have a black path count of 2.

[@kunalkheeva]

thanks.

[@Amine-gz7gq]

Very clear ! Thank you, I can sleep less ignorant about this topic. C++ STL's std::map is a RB-tree.

[@larsson4488]

This is top notch teaching!! Many thanks

[@americantech4151]

Great Explanation. I learnt a lot,Thanks you so much Mam....from srilanka❤

[@abhishekchandel4017]

In college I don't understand well to this topic, But Now I have clearly understood to this topic. Thank You so much mam for providing such type of lectures 🙏🙏☺

[@ayushpaine5650]

Us bhai us

[@ayushpaine5650]

Ek toh Sujith ko padhana aata ny h lauda

[@toetoeag]

You have explained very clearly.

[@GauravKawatrakir]

It's better to have the script because we forgot sometimes what we speak or what we suppose to speak. Explanation is damn good.

[@abhinav_himxp]

yeah

[@SandeepKumar-lh7ge]

Waiting for this... Thanks you so much Mam😊😊 Keep it up 🤗

[@JennyslecturesCSIT]

yup... will upload insertion and deletion on tomorrow and day after tomorrow

[@ManeeshRamaram]

i dont even study engineering but yet watching the whole thing with hundred percent attention.

[@sakthij7003]

I like that she wrote Black in black marker

[@khushbuverma8972]

Maam you are a good teacher

[@LakshmikanthkSICS]

Mam ur teaching is assum mam I think ur teaching more helpful for students

[@fallinlovewithcars]

Thanku sooooo much ma'am for these lecture. These lecture help a lot for our university exams

[@Milind.x]

your teaching made it easier to understand the concept..... thank u for such videos......

[@susml767]

You are unique!! Excellent and to the point!!

[@SaileeShingare]

Thank you making me understand the concept of red- black tree clearly, needed this in lockdown ☺️

[@ayushpaine5650]

Randike lockdown Main kya karra tha tu

[@shubhamaggarwal4676]

Awesome teaching and great explanation ❤️❤️

[@MuhammadUsama-zf3iu]

Awesome Video, Thanks for Sharing, It always amazing to learn from beauty with the mind.

[@OnlyCompleteSolution]

Ha mam h red black tree Mam aap bhut achi inshan ho Bahut acha badati ho Mere ko shi english nhi to be Samj a rha h thankyou mam

[@abhisheksiwach1406]

Thanks a lot for all the efforts !

[@jenishdholariya6224]

I am waiting for that video thank you so much mam you are helping us very much .. . 👩‍🏫

[@armandoantoniogarduno4969]

Thanks for sharing, the RB Trees looks clearer now.

[@stasbakalo6264]

Wow, that is very clarifying explanation, thank you!

[@neelmanikumar6765]

Thank You, ma'am, for such a beautiful explanation ...

[@mukundingle1197]

liked what you said about why head-of-the-family is black and not red and doing Yoga :-)

[@hemanthsuresh]

Thank You very much maam because you are doing a great job especially at these times where everyone is running behind profit and money . Some good humans still exists in this pathetic world. 🙏

[@codingpracticewithabrar9554]

Great lecture and the answer to question on the end is 10->15->nil path, the count of black property is not maintained

[@arusanoor6594]

i love ur teaching method

[@dharmeshshrivastava6714]

Ma'am Please make videos to elaborate Computational Geometry (1D,2D, Quad tree etc). I also would like to mention that your way of teaching is awesome. Thanks.

[@Badwolff.]

Your video s is mind blowing

[@SandipHodkhasa]

Very refreshing to see a KZbin instructor that is not male

[@Vjvlogs777]

thanks jenny helped me for my exams

[@nirmalrajpurohit2728]

Quality teaching !

[@neelasatyasai6852]

Being a Mechanical, reached video 64/112 in this playlist.

[@mohit7875]

The process of teaching is very well and I am very thankful to you

[@shahdmohammed9514]

you are perfect !! thanks for bieng this professional

[@LiquidWater91]

Thank you for this awesome video, I never understood how red-blacks were better then other trees before. but your explanation of how it compares really clicked, thanks a lot!

[@k.mahesh7084]

U and ur explainantion is very beautiful

[@ericfricke4512]

Very thorough and clear, thanks.

[@vakhariyajay2224]

Thank you very much. You are a genius. 👍👍🙏🙏👌👌🔝🔝

[@akanshasharma1365]

didi you are so good , because of you i m interested in daa , thanks for clearing our doubt

[@shaswatdasgupta3776]

Hi All my life I feared datasturcture until I came across your channel. Thank you so much. About the question definitely its not a red black tree because, the no of black nodes from the root to leaf nodes is not constant. From left if I consider nil then the no of black nodes are 3, but the right sub tree it's 2 (If a black node is consider after 15 (Red).Did I get it right? 👍 from Bangalore

[@LochanSaroy]

Bro isn't this tree voilenting the 4 the property that is ''Every leaf which is nil should be black'''.

[@saaagararts]

Take your notes at 32:48 (rules for Red-Black trees)

[@chetnawadhwa4345]

Very knowledgeable and understanding video

[@princekumar-ot1ul]

In last example(at 32:50)........It is not a RB tree.....violating last property(at node 15)

[@bikrambikashdas4057]

true

[@sriramamara5100]

Mam love you .. excellent teaching

[@astr0plays]

11:50 - Thank me later

[@esra_erimez]

Oh my God! THANK YOU!!!!

[@viplovedev]

Thank you!

[@lawbindpandey402]

Damn bro didn't get u first time but after watching for 11.50 minutes .I understood you!!🤣🤣by the way thank you!! Try to be more specific next time ..it'll be of much help...thank you once again

[@jojomampilly274]

1 min in.. i got you bro

[@shashisharma307]

Story starts from here... :D

[@upsccivilspreparation3141]

Really I love you ma'am.. you are awesome

[@furzi1432]

The last tree is not red black as from 10 -- 15 -- Nil only 1 black and all other path have 2 black. Thankyou so much mam😀😀😀👍👍👍🙏

[@tushargupta2009]

most awaited topic, thnku mam

[@jigarjoshi1811]

I wish ki you were my college teacher I wont bunk a single Lecture of yours

[@JennyslecturesCSIT]

ohhh really, great......you can assume me as your teacher

[@jigarjoshi1811]

@@JennyslecturesCSIT you are my teacher. It would be nice if you can teach all subjects!!! 😅

[@mahendrasahani9148]

good teaching methodology...thankq madam

[@rahuldeshpande3516]

Answer: Its not a red black tree. Because of the left nil of Red Node 15. Property - all paths have same # of black nodes is violated for root node. It has only 1 black node on its path from Root to 15 to left NIL (we don't consider the root color in calculation)

[@anjalikhatri1962]

Thank you mam for doing such a great work❤

[@Badwolff.]

Hi she is the best teacher

[@kashmiramathur8673]

Thanks a lot maam u r doing a really great job. Grateful to uh