A way of traversing a tree that processes the current node after processing the left and right subtrees. This is a depth-first algorithm, and can be compared to preorder traversal and inorder traversal.