 So similar to the pre-order traversal, you can have something we like to call a post-order traversal and You can think of it as traversal the idea is In a pre-order we visited ourself before we handled any of our children the exact opposite It's going to happen when we start dealing with our post-order. So Let's say I've built out the algorithm again. I'm at some N I actually go to my child first that for each child of N post-order That child then I get to with my air quotes visit My in so only after I've gone down as far as I can can I move forward so in this case? For example, I start at a well, I can't Immediately visit a instead. I have to say for each child of a for each child of a means I start at b well I can't move forward until I've finished visiting b and so once again for each child now since e has no Children it's a leaf node that means it's going to be the first element that's visited Then I come to f well once again f has children so f is not my first or my second traversal It's actually going to be its children and then since these have no leaves. I can't go deeper I go to the next child the next child has no children. So it is the next visit and then okay So now that I finished this now that I finished visiting all my children if you notice now I can come up and that means I can finally visit f since I have finished visiting These children I can finally visit b the same thing comes in with a I don't traverse a yet Because I just finished one sub tree. I still have two sub trees to go here So again, I come over here and see see has children. So that means I got to go down to its children G has none. So it becomes now my seventh traversal h nine Ten and only since I've finally visited all of these levels. I visit the one All these leaf nodes now do I finally get to visit a?