Tree Traversal
Traversal Algorithms
Depth-first traversal of an ordered rooted tree can be performed in a preorder traversal, an inorder traversal, or a postorder traversal.
When used to represent math expressions, these correspond to prefix form (a.k.a. Polish notation), infix form, and posfix form (a.k.a. reverse Polish notation).