Red-Black Trees - Data Structures

[@markovchains573]

Thank you! This type of quiz was very memorable compared to just reading about red-black trees and trying to remember their properties.

[@devnarula6733]

i can't tell you how informative this video was, you taught me more than my professor did in a year, your content shows your love for sharing knowledge, thank you very much!

[@Softwarecom]

Thank you so much for talking the time to do this !

[@valnaglyz4148]

THIS IS WHAT WE NEED BRO THANK YOU!

[@user-yb8ez3kj2x]

thank you , i have masterd red_black tree by learning this video while learning < introduction to algorithm > doesnt !

[@Ghostdog_89]

That is probably the best video of red-black tree overview. Very clear. Would be nice to see some explanations on the rb tree operations. Anyway, thank you!

[@anandramaswamy2416]

Thank you the quiz was great

[@DeusExAstra]

I had to watch this at 1.5x speed

[@davidjwf1945]

of course

[@firibuanyass]

Me toooo .

[@Coldsteak]

i had to watch it at 0.5x speed (im mentally disabled)

[@simplicity1480]

Must needed

[@ak689]

Update your processor with latest one :D

[@ThisIsMMI]

He is just roasting Dora the Explorer 😆😆 Superb explanation by the way !!

[@vijaykumarlokhande1607]

Okay, now I know what red-black tree is.

[@godzosioda]

Thanks for your explanations!

[@allyourcode]

The examples are great!

[@ms_1918]

Best video ,Thank you sir

[@ranjeetkumar2051]

thank you very much for making this video very helpful ❤❤❤❤❤❤❤❤❤❤❤❤❤❤💕💕💕💕💕💕💕💕💕💕😘😘😘😘

[@xiaoruizhou694]

Really good video explanation! Thank you very much.

[@stevefrt9495]

nice explanation, thanks

[@harshal.jaiswal]

hey check out this redblack tree app for android device (easily check for correct answer) github.com/harshaljaiswal4555/RedBlackTree/raw/master/RedBlackTree.apk

[@systemforge]

Wonderful... Thank you

[@logandev2599]

that's amazing thank you

[@gmeka]

thank you so so so very much, helped me last minute for my assignments. :3 :)

[@gracehu3031]

thank you!:DD

[@mrenmajozi2617]

For number 4, isn't both the RED and DEPTH property violated?

[@MisterCode]

Indeed, the external node to the left of node '31' has a black depth of 1, while the other external nodes have a black depth of 2. Therefore, the Depth property has been violated too. In order to be complete, I should have mentioned that too in the video. ;) This, of course, won't change the answer to the main question; 4. still isn't a red-black tree. Thank you for your remark! :)

[@lNDlANSPlCE]

@@MisterCode thanks for the video! Helped a lot :)

[@danialnekounam8599]

very clear thank u

[@techmoon_]

Great content 💥

[@rayhanshuvo1619]

Really Good

[@jananiebalaji3698]

Hello sir, Could you please post the link for the insertion part in the tree in the comment? Please post videos explaining Splay trees and binomial & Fibonacci heaps as well .

[@harshal.jaiswal]

hey check out this redblack tree app for android device (easily check for correct answer) github.com/harshaljaiswal4555/RedBlackTree/raw/master/RedBlackTree.apk

[@vivekiyer9273]

what do you think about teaching in youtube is a good profession? Is there any earning by doing this?

[@vivekiyer9273]

please reply as soon as possible.

[@user-pz4eg1ql5z]

Vivek Iyer you can gain happiness if you share your knowledgement with everybody.

[@vivekiyer9273]

but if we are working,editing and giving time it should be more than just happiness

[@vivekiyer9273]

that is why I was asking for this question

[@vivekiyer9273]

don't think I am greedy :)

[@maysoonhussien3714]

thanks

[@AdityaDahiya99]

For number 3 shouldn't all the leaf nodes be black?? 29,50 and 83 are not.

[@diaworld7166]

kia baat? angrej log 4 example m master kr lete h kia?

[@marmikemp3767]

Awesome accent.

[@atulvidyarthi9952]

Is red-black tree not colours on top of AVL tree? Please reply..

[@sohamroy4086]

In Question 3, the tree isn't height-balanced. So it isn't a Red Black tree. Please confirm.

[@deepeshdanieljoy]

I think the definition of Red Black Tree balance is the depth property, rather than being rigidly balanced (AVL Trees). If it is height balanced, then the Red-Black Tree becomes and AVL with Color property

[@ExZeMIP]

Dutch?

[@riddlediddleriddle]

Dora the Explorer he says haha xD

[@samiulislamdurjoy]

G150 3:43

[@tarungupta5827]

Leaf nodes can be red too!

[@saramarquez3564]

guapo!

[@sn__tz1144]

You sound like Yung lean

[@vivekiyer9273]

Is you earning any money from youtube?

[@Frustrated.Indian.]

you can earn only after you hit 10000 subs. which he deserves, but is yet to hit that mark. private providers can still pay you.