Post-Order Tree Traversal
Another depth-first Tree Traversal algorithm commonly used is post-order traversal. It differs from Pre-Order Tree Traversal in the way that it first visits the children of a node before visiting the node itself.
Search
Another depth-first Tree Traversal algorithm commonly used is post-order traversal. It differs from Pre-Order Tree Traversal in the way that it first visits the children of a node before visiting the node itself.