5.21 Splay Trees Deletion | Bottom-up Splaying | Data Structure & Algorithm

preview_player
Показать описание

In this lecture, I have discussed how to delete data from splay trees with an example. I have explained all the cases of deletion.

******************************************
See Complete Playlists:

***************************************************
Connect & Contact Me:

#whatissplaytree
#treeindatastructure
#ugcnetcomputerscience
#jennyslecture
Рекомендации по теме
Комментарии
Автор

I like that you always repeat at the beginning of the video, that you need to do the splay-operation after every other operation. I need this kind of repetition to make things stuck in my head :-) Your splay tree videos are great for my practice tasks from university, I need to do. Perfect explaination!

johannesalbrecht
Автор

Hi, very great explanation! But I have a question. In the last deletion where you delete node 17, as it is the root node with only left child, we do not need to splay any node, and 15 automatically becomes the new root. However, what if node 17 has both left child (left sub-tree) and right child (right sub-tree), then which node would become the next root node? And do we need to splay any node in this case? Could you please clarify this for me? Thank you very much!

Naux
Автор

Wow thank you, i understand it very clearly!

jimquila
Автор

Thank you, it was quite an instructional video! I appreciate your work! Keep going!

cesarteddybear
Автор

Youre doing a great job.Thanks for the classes!! ✨

iamthatsid
Автор

Thanks you Soo much maam mujhe ye topic RHA Tha tree chapter mein krne KE liye thanks alot . You are very good teacher .

AjayThakur-zbee
Автор

I'm doing some algorithms homework now and interestingly enough in the model answer the element replacing the deleted node is splayed to the root node position and not just its parent as suggested in the video. And I've seen several other sites where it is done this way as well.

The_Last_Emperor_CLG
Автор

At 4:30 it become zig zig situation. some will rotate the grandparent first i.e., 14

rohitk
Автор

you are really a great teacher...thank you so much

shivaprasadm.s.
Автор

Splay tree deletion explained so precisely.

tushargupta
Автор

mam competitive programming ke topics kara dijiye jaise dynamic programming, graph theory, greedy problems ....with their codes in any language that u

devgupta
Автор

Thanks a lot for your help for explanation !!! after going through this video this concept is crystal clear to me !!!
Again Thanks a lot for making such a wonderful sessions!

shiv
Автор

I understood so much better. And thank you for giving extra info, it made a lot of sense.

I’ve subscribed :)

Would it be possible if you could group your videos together in separate playlists? For example one playlist for splay trees, one playlist for dynamic programming examples etc

I wish I came across your channel sooner! You explain so well!

prashannakumar
Автор

Best explanation ever mam ❤
Mam plz make a separate playlist for asymptotic notation time complexity..

ankitjha
Автор

Thankyou very much ma'am. The channel will keep on growing . Keep the good work !!!

soorya
Автор

Well Explained... Topic is completely cleared

prathmeshatre
Автор

Ma'am plz tell when u will come live tell with date and time I have some doubt . Last time I missed your premier.

AjayThakur-zbee
Автор

your lacture are so helpful thank you mam

rajatsajwan
Автор

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

vakhariyajay
Автор

After watching this video I 'v seen this video again for u mam
.... Thank you mam😍

sukantadas