 What's up guys, my name is Michael and welcome to my YouTube channel today We're gonna go over how to do post-order traversal on hacker rank post orders the same thing as pre-order except Well now you're going to your notes Now you're going to your notes instead of printing your current node your app So instead of going to instead of printing your current node first We're gonna just recursively call on the left and the right so how you remember this Just know we're going to left right and then note Right left right note. So to do this. We're just going to do this personally call on the left So if the root oh what the? The roots love it does not equal to know Whenever turn If the right is not equal to know then we're gonna personally call on the right and Then after that we just check if roots is not equal to know We just print out our node. So for this one, we just do this root right Root left. Yeah, that's it. And then for some reason it's not working printing out Wait a minute post-order post-order is Node is a right left node. No, I'm pretty sure it's left right note First we call the left first we call the right four three six one Christian on the left root is equal to know to go right right Left right node. Well, maybe I need spaces Still it doesn't make any sense. All I needed was spaces That was dumb but yeah That's all you have to do. Just go to Left node and go to the right node and then just print out your current node So here I recursively call on the left. The left is not null Then otherwise I recursively call on the right if the right is not null And if my current node is not equal to null, I just print out the current nodes data So I just go left and right and node and the reason why it's called post-order is because you're printing out your children first And then you're pretty at your current node Yeah, very calm subscribe, but check you guys later. Peace