Binary Search Trees (BST) Explained and Implemented in Java with Examples | Geekific

[@FluteVJ]

It took me some time to understand the deletion of the node that has two children. But finally understood after watching again and again. Thank you very much. You are doing a great job and I'm a big fan of your channel.

[@alooooshm]

This is super great! It's truly fabolous how you compress all the heavy concepts in 20 minute video and still be as detailed and practical as a 3 hour university lecture. Pretty much respect keep it up🙏

[@geekific]

Thanks a lot :) Really glad I could help!!

[@o.s.1406]

You are more helpful than my college professors. I would rather pay my tuition to you!

[@cetintekin9520]

Hey, Been watching your videos to understand basic data structures and algorithms. Just wanted to thank you for your expainations and using generics. You are a great help.

[@geekific]

Glad to help! That's what the channel is here for :)

[@vladimir3450]

Because of your way how you explain, you helped me to understand it very fast. Thank you

[@geekific]

You are welcome! Glad it helped :)

[@ioanacrisan3684]

Thank you for your work! Great graphics and nice explanations.

[@darkstudio3170]

Saying again , its a underrated channel. while the videos like "A day in mang\fang" gets millions views , this gold content is not nowhere touching 10k views. Says a lot about people behaviour in general.

[@joeyyin1518]

The implementation of deep recursion is awesome !!!

[@geekific]

Glad you liked it :)

[@prashantrajgor03]

This is really useful, just have one question, the code you provided for inserting node will work if there is a duplicate value?

[@geekific]

Glad it was! Nope since we have comparison for greater and smaller only :) Cheers!

[@blake-hz5vx]

Great video very helpful

[@sadiulhakim7814]

Nice Video

[@chim8938]

What about removing with a parent pointer?

[@SaintC0bain]

This is a great video! Thank you!

[@geekific]

Glad you liked it!

[@Mamelcrispen]

this video is sick you helped me so much thanks

[@geekific]

So glad it was helpful! :)

[@ahmad-ali14]

super helpful

[@jiu89b68hso8]

Thank you!

[@sivamediboina9711]

Great for reducing the code by adding more methods. height (node) method has a condition if the node is null then it will return 0. My suggestion is return -1 instead of returning 0 then AVL balancing works perfectly. Any one Please let me if anything is wrong from my side.

[@geekific]

Hello! Am not sure I got you, but feel free to check our AVL video here: kzbin.info/www/bejne/gJucfpyqZ5l2jc0 :)

[@abanoubmaged3647]

In the delete implementation .. one child case .. how is the child is automatically assigned as a parent (in the return statement)?

[@geekific]

Yes! It works similarly to what was explained between 15:00 and 17:20

[@cropduster34]

Mr. Takei?

[@geekific]

🖖

[@kawaeeee]

where is main testing code...

[@geekific]

Hey, I figured it was better to centralize everything in the same video :) Check it here: kzbin.info/www/bejne/np62d6iDZ7maotk. Cheers!

[@maxfan6035]

I could not understand the part of deleting a node having two children nodes. Pronunciation of the words threw me off

[@geekific]

Sorry about that! Feel free to ask any question and I'll try my best to clarify :)