They are DFS traversal orders: preorder visits node-left-right, inorder visits left-node-right, and postorder visits left-right-node.

Inorder is especially useful for binary search trees because it returns values in sorted order. Preorder can serialize tree structure, and postorder is useful when children must be processed before the parent.