 So now that I've built out that structure, and I've got all my elements from the previous video sort of just blown up a little bit, let's say I wanted to do a lookup. For our sake, let's say I wanted to do a lookup on two. So this is where we would actually follow the same principles that we saw inside of a traditional binary search tree. I look at my first node, at my root if we will, and I say is two in here, is three equal to two, and is seven, or is seven equal to two? Well in both those cases, it's no. So what do we do? Well then I have to kind of make a condition. I have to say, well what do I do from here? I've got three elements, three nodes I could go to, so I need to determine which one to go to. So the same question is going to get come into play. I ask, well is three, sorry, is two less than three? This happens to be a yes, and so what that means is I'll go to my left. And what do you know? Two happens to be in that node, so I'm good. But what happens if instead I said something like a lookup ten? The same principles are going to come into play. I ask first is ten equal to three? No. Is ten equal to seven? No. Same question. Is ten less than three? No. So I don't go to the left, but I don't immediately go to the right either. I have to make another check. Is three less than ten, which we did agree upon, and is ten less than seven? Basically we're saying is ten in between my two keys? Since this is a no, then we get to ask is seven less than ten? Since that's a yes, then we get to make that traversal. We see that ten's in our tree and we return it. So as you can kind of guess, if I made one final lookup, let's say for example I did lookup on that four, same principles come into play. Is four equal to three? No. Is four equal to seven? No. Is four less than three? Nope. But is three less than four, and is four less than seven? Since that's a yes, we go down our middle path.