The document describes pre-order tree traversal, which prints the root node, then traverses the left subtree, then the right subtree. It provides an example tree with nodes A through G and root node ROOT. The pre-order traversal sequence would be ROOT, A, B, C, D, E, F, G.