5.19 Splay Tree Introduction | Data structure & Algorithm 

Correction: at14:21 9 will be left child of 10

Splay tree is the topic which you will hardly find on youtube. Thank you mam for explaining this topic so perfectly on demand.

Correction - 14:20 that 9 shd be to the left of 10 and not to left of 7

Really appreciate these lectures here, helping me in the last moment rush to study things when the notes don't explain anything conviniently

awesome explanation ... thanx a lot, your all videos are helping me prepare for my upcoming exams... god bless you

someone already mentioned it but im gonna right it anyway for anyone didnt see that comment , 14:20 9 is gonna be the left child of 10... and Jenny thanks.. getting use to the accent btw.

Node(14) will take 3 rotation. At first,it will take left rotation (zag) and will be placed where node 13 is then it will take right rotation (zig) to take place of node 15 and then at last it will take left rotation (zag) to take place of node 10 and therefore by this way it will become root node.

In case of zig-zig or zag-zag rotation we are first rotating grandparent and then parent but in case of zig-zag or zag-zig you are rotating first parent and then grandparent. A little bit confusing

I get to confused with your zig and zag pronunciation but concept wise its really good !

Thank you very much for helping me understand this topic!!

28:20 -Zag-zig rotation and then Zag rotation 3 rotations applied

hello mam , your way of explanation is very cooll,,and one of my friend named avi goyal is also your great fan

Merci tu as sauvé mon examen d'algo !

Sooooo helpful, you saved me today, ma'am🥰

This video will be most useful for me before exam .. thanks a lot

thanks for very clear explanation!

Just Amazing as usual

i didn't find code implementation of trees in cpp, i love your videos way of teaching kindly pls make videos of implementation

Very nice delevering technique to student . Watching from surkhet nepal.

I love your teaching mam🥰 i think am fall in love in your teaching❤

to search 14 we need 3 rotation zag - zig - zag in splaying.

I am lazy, I just like videos to support who made them. But this video is THE VIDEO on RB trees. I saw it fully with adv and repeatedly. I pray you should feel satisfied and fulfilled in all your life.

Excellent Explanations Jenny... God bless you !!!!!!!

I have never seen such kind of teacher, teaching as perfect as you are!!! We Are really Very Glad😊 To Have youu Mam🤌❤️ Such an extraordinary concepts you have built yourself, really great mam hats off to you 🙌🫶✨

Mmm expected video from my side ...thanks 😍

wow! You gave a very clear explanation madam

Maam DBMS series will be uploaded and completed before 24?!?! Was about to start tuesday nA

Thank you very much. You are a genius.

mam what about the case in which grandparent of the node (to be searched) is not the root? like searching 14 in the last example , if we perform any rotation in case3 like (zig-zig ,zag-zag, zig-zag, zag-zig) then 14 would not be at the root , it would 1 level below the root? is that correct?

Thanks for taking my request

Awesome explanation thank you....

amazing explanation, thank you mam :)

Hi ma'am, I have a doubt, at 14:20, the tree on the left states that 7 becomes the root for 9 and 10, but then why is 9 on the left of 7, shouldn't it be on the right side of 7? Or we can have 9 instead of 7, 7 on the left and 10 on the right?

Mam, all your lectures are very good. In this lecture you have stated multiple times zig and zag are sometimes said in opposite way, can you please provide some reference to which books or reference you are referring to?

a big thanks for your work

Thanks mam, easy to understand :)

Hello, in minute 16:00 the 13 in the ZAG seems wrongly placed in comparison to the 9 in the ZIG or viceversa.

ma'm i really appriciate your study videos. they are very useful for my studies. thanks alot from sri lanka😘😘

Thanks for this wonderful lecture , keep it up Jenny 👍👍 you are doing a wonderful job for all the learner’s out their .

Hi Jenny, Cud u review this and clarify/confirm/correct? Suppose a and b to the left and right extreme of splay tree are the most frequently accessed. search(a) zigs, makes a root, and pushes b down by almost double height. And search(b) next zags, make b root, and pushes a double the height down (when compared with the original tree height). So, every time these 2 searches happen consecutively, multiple rotations and too much skewing of the tree would occur, and search would be O(logN) and never O(1) How about use Treap instead of Splay Tree to achieve the same? The splay tree keys become Treap keys. Keys satisfy BST rule. Number of searches for a key becomes the node's priority. Priorities satisfy max-heap rule. Hence all those keys that are most frequently searched would always be very close to the Treap root, and skewing would also be relatively lesser. And, above case of search(a) and search(b) happening consecutively, and many times, would ensure that a and b stay very close to Treap's root (if not become the root) due to tremendous increase in their priorities. The extreme zig or zag as with Splay Tree wouldn't happen here. Is there any mistake in my understanding? Please comment on this. Thankyou! :)

legendary teaching!

From a main tree if i want to search -1 what is the procedure to be followed? which type of rotation it would be!?

Your lecture on splay trees are very superb...👏👏👏

for searching 14 can we do first zag zig rotation and then zag rotation ?

Thanks maam today I was looking for that topic in your playlist please complete it ASAP

It's very clear to understand Tsm sister

in The zig-zig rotation on the final tree, as we know after splaying the tree must be BST(i.e left child of anode is less than the root node and right child is greater than the root), but when we look the result of the tree after splaying(1) it is not BST( i.e when we look node 7 its left child is greater than (9>7)) why?????

Upload on AA tree,KD tree also if possible😄bcoz I know no one will explain it like u :)

Mam aapke padane ka style wahhh I like you mam

awsome lecture...keep going

mam 2 rotations will be needed for 14 that is zag-zig then just zag

Answer is Zig-zag-zig rotation Thank you memdm ji

thank You So much . Understood Prefectly .♥

mam don't you think that you should also provide the code for better understanding?

mam...i saw the same tree you told told that parent of the searched node has to roatated untill the root is obtained....in java point website they tod to rotate the grand parent of the node untill the searched nodde is root...which is right mam??can u repost a new version of this vedio reclarifying it??

Ur energy is fierce

Awesome ..!!

Madam sply tree Ana split tree Ana same ha

in zig zig how can 9 be the left child of 7 splay trees also follows the bst right?

Ma'am pplzz add videos for B-tree. It's really an important topic for our university exam. And I my only source of learning is u.

Mam can you tell about skip list and xor lists

Mam insertion of splay trees?

Very systematic and clear explanation, many thanks!

lastly mam wrote one more feature , but unable to see, could anyone tell.

Mam plz Also discuss answer of your question at the end of the video Becz we unable to get we are right or wrong?😃

What is the point of splaying when we have already found the node?

if a node have more than two parent than how many rotation need to do , mam ji ? do we need to make a node as a root node always if I am searching that particular node ?????

Thank you Lady!!!

for last question ‐---》 *s1 : * zig rotation of 15 so 13 is new parent and 14 attaches to 15 on left side *s2 : * zag rotation of 10 so 13 is new root and 11 attaches to 10 on right side *s3 : * zig rotation of 15 so 14 is new parent *s4 : * zag rotation of 13 so 14 is new root right?

Binary threaded tree.. Mam??

Thank you

Very well explained

One ZIG-ZAG rotation i.e. for nodes 15-13-14 (LR) and then one ZIG rotation i.e. for node 10 -14 (L) :*

First zag then zig zag mam to search the value of 14 . Mam do correct me if am wrong . This is the answer for question asked @ 28:18 Really mam its helping a lot till now ....its like literally 4years since this playlists has been uploaded , we dont have any fikar about ds ka subject. Thats the power of a quality teacher ! Take a bow!! Thank you mam !

15:01 result of zig zig rotation is not following BST property, 9 is greater than 7 so it should be in a right of 7.

Very nice explanation! But I have doubt. After every operation it splays which usually leads to loss of its balancing property, but still we says that its a self-balancing tree. WHY??

the most frequent one or the recent ones?? i guess it should be recent ones

Mam greedy algo pr bhi video bnayiye.

why you don't write the code of AVL and RedBlack ?

There after zig zig rotation 9 is placed left to the 7 but it was greater than 7 ,9 shoud be placed right to the 7

Mam plz post short cut for all subjects useful for competitive exams

Well explained Mam ☺️

what is the difference between strictly balanced and roughly balanced ? can any one plz help

mam, please make a video on aa tree also

Thank you sooo much

At 14:32 the Child of 10 should be 9 and 15 but you write child of 7 as 9 and 10 ,as we can see 7 is smaller than 9 so 9 cannot be in its left side i think so please let me know this ?

2 ROTATIONS 1>ZAG-ZIG((zag part)14 will come to the 13 place and 13 will go left to the 14 after that (zig part)14 will go to the 15 place and 15 will go right of 14) 2>ZAG (14 will go to the root place and root 10 will shift left of 14)

The node 9 goes to left child of 7. I think it is not possible. Violating the rules of BST

Please make a video on segment tree

Ma'am I kindly request , Please teach us about trie data structure with code implementation.

at the very first instance ,your beauty n now your hard work is compelling me to fall for you..😊😊

(search - node 14 )require 3 rotation to become a root

Mam Will you please check the BST after the zig-zag rotations I think it doesn't follow.....if I'm wrong then ignore me🙂🙂

Ma'am can you please upload video on Kd Tree .....

mam plezz make a video of tries data structure....

Searching 14 requires a combination of three operations mam: Zag - Zig - Zag! Guess am correct! If not please let me know. Thanks for being this super excellent and precise. May Allah bless you

Thxs mam for uploading this vd😍

Mam, threaded tree... Please??

Need a video on AA TREE please...

16:48 -> right-side if you want to search 30; we will perform 4 zig rotations i.e. zig zig zig zig rotation....