 What's up guys, Mike the Coda here today, we're going to go over in order to each reversal. Same thing as other traversals, except we're going to go to the left side, then we're going to print our print our current node, and we're going to go to the right side. It's left, left, then node, then right. So let's do this recursively call on the left side. So to do that, I'll check if the left is not null. Because if it isn't all, then you can't really do anything. You can't do that. So we're going to go left. It's got to do root left. And then after that, we got to do not the node data, the current data. And then we do the same thing for the right side. So I got to copy this right side, right side. I got to check if the root is null also, root is not null. OK, and then I could print it. So you got to check if it's not null. Like if it's null, you can't really do anything, right? That means there's nothing there. Yeah, this should work. That's it. That's pretty much the tree traversal. Go to the left side, print your current node, go to the right side. Great comment, subscribe. I'll check you guys later. Peace.