 So now that we've discussed the idea of doing a trinode restructuring with that abstract concept of giving making our x, y, and z turn into an a, b, c and then giving those things let's actually apply it to our double rotation of This 6, 7 insert 7 that we've done here So in that case as we just mentioned I do some kind of mapping I find out what my z is in that case Sorry, my a which happens to be the grand apparent. I find out what my Let me change colors there. I find out what my z was which was or my a was z I find out what my b was which was x and I find out what my c was which was y my parent So once again what I'm going to do with this information is I'm going to change it so that x Just to bring this up a little bit x Will become the new parent for z and y so like I said what we do is we take our structure. I Still have my 5 in the same spot. I still have my 2 in the same spot. However once again x is going to become the new parent so 7 shows up here then I Get my z and my y to become My children once again. We've already mapped it out as a and c are the children of b a is the left child right c is the right child so in our case 6 will become the left child of 7 and 8 will become the right child of 7 So once again, we've made our change. We've made our rotation. We're still in That insert 7 we still have not completed this so the question becomes What's my bf? What's my bot balance factor? Well for my 8 and 6 since their leaf nodes We know that those are going to be 0 to wasn't even touched so we don't even have to touch it 7 we see that it's balance factor it can go Down one node on the right it can go down one node on the left And it happens to have a balance factor of 0 meaning that Even though 5 you know 5 is technically also being looked at in this situation It can go well since you know why not Since it can go two nodes to the right and one node to the left it happens to have a balance factor of a 1 so while This tree is right heavy. It's not terribly impossible We have not broken the laws of physics just yet or the laws of our binary search tree of our AVL tree And everything is good to go