 So what if, given this tree here, I gave the remove operation of remove 50? Now you remember in the previous video, I had to look for my in-order predecessor, what came before me. However, I don't have anything. And in our case, just like we've done in the past, I would remove my 50. It's gone, haha. But what happens to be left? Well, I see that I have some right in-order node. I would go from the left. I see I have no nodes on the left. So I just used, in this case, my, I'll say this, if no in-order predecessor, use in-order what we would call successor. What would be the next access node? And in our case, it's the 75. So we would give 75 up here. And so just to draw that out again to 25, 75, 10. And once again, we see that I happen to have a z, a y, and x. Both are in a zig, zig formation. So I simply would tilt this the opposite direction. And so what I should see is 75, 25, 2. Now, I still happen to deal with that 10. And as we've seen in the past, I happen to have a t1, a t2, some t3, t4. Now, given that we're dealing with a right, right, zig, zig, we would give t1 and t2 to x. So in this case, I would come in. And 10 would be given to the 2.