A per order would put the cout statement before the parent->leftChild
recursive call and a post order would put it after the recursive call
What it does is it first goes all the way to the left most node. And prints
it. If the left most node has a right node, then it prints that. It "goes"
up the tree like that. Google it, better explanation out there. Its late
so I can't use my brain much.