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