Traversal is a procedure that visits all nodes in a tree and prints their values. Because all nodes are linked together by edges (links), we always begin at the root (head) node. That is, we cannot visit a node in a tree at random. In-order Traversal, Pre-order Traversal, and Post-order Traversal are three methods for traversing a tree.