A tour of the nodes of a binary tree obtained by using the following recursive algorithm: visit in postorder the left subtree of the root (if it exists); visit in postorder the right subtree of the root (if it exists); visit the root of the tree. Compare preorder traversal, symmetric order traversal.