Pre-Order Tree Traversal
This is a method of depth first Tree Traversal in which we visit a node first and then visit its children, recursively. Thanks to its recursive nature, this allows for an easy-to-read, intuitive depth first traversal algorithm.