How to find successor and predecessor in a binary search tree 

This man dropped the best binary tree video ever and disappeared

"how to find predecessor and successor in binary tree" *rockin' intro music* awww yeah im ready to learn!

Seriously, publish more! haha Thank you for going over all cases.

Very helpful!! exactly what I was looking for. Thank you so much!

Thank you very much. Your explanation was brilliant.

Good explanation, clear and easy to understand! Do more video, We all support you!

Great video, and it was so easy to follow.

you should change 3 conditions to find a successor to 3 conditions to find a predecessor. It is obviously predecessor but it could cause confusion.

Nicely explained in concise points. Thank you, and keep it up.

Very helpful! Thank you 😭🥹

why did you publish only 1 video? you should keep going i think

Great explanation!

Thanks for the explanation! Btw I don't understand why some of the comments are SO MEAN. Hopefully nobody will say something like that to those people when they are learning a second language :)

Thanks, nice explanation

Great video, thanks a lot!

Really good explanation!

COME BACK WE NEED YOU

Thank you!

great video

Thank you sir Could we use the same method for finding the successor and predecessor in 2-4 tree?

well done

very helpful... thanks a lot..

The time of run is O(n)?

fantastic!

Great Video Keep it up ignore the haters.

Amazing!

Thank you

Set playback speed to 1.5 and thanks me later.

thanks

Thanks man

What is the 'chan' by the way? I can't understand...

Great

I found it quite useful but if I say you put me to sleep I won't be exaggerating

Video could be alot better : Need to speak clearly. Use the correct terminologies, the word is not "chain" it is called an edge.

Make the video speed 1.5X and I think thats more genuine than the normal one!

was good thx

可以试试讲中文LOL

your speech is very poor and not perfactly audale.

Learn to speak clearly

Thx bro From kurdistan 🤍🇹🇯