 So now let's say for our sake, I came across this tree and I made a remove 25. So we're kind of in an interesting position because if we're dealing with a splay tree, the node that we access happens to go to the top. However, we're dealing with a removal in this case. So one, that node goes away. And two, that node happens to be my root. So if, in this case, if we're dealing with some in, if in is root, we remove in. And some, how can I describe this? Some child becomes the new root. Now in our situation, that's quite easy. We see that we would remove that 25 from our tree and then we would be left with 30, 50, and 75. Now I say some child. In our case, we look for whatever my least possible child would be, in this case, that 25. And we happen to be left with 30, 50, and 75. And so we're automatically done.