What is the result of a post-order traversal on a binary tree?

What is the result of a post-order traversal on a binary tree?

Step 1: Start at the root of the binary tree.
Step 2: Move to the left child of the current node.
Step 3: If the left child has its own children, repeat Step 2 until you reach a node with no left child.
Step 4: Once you reach a node with no left child, visit that node (this means you record or print its value).
Step 5: Go back to the parent node and now move to the right child.
Step 6: If the right child has its own children, repeat Step 2 until you reach a node with no left child.
Step 7: Once you reach a node with no left child, visit that node.
Step 8: After visiting the right child, go back to the parent node and visit the parent node (this means you record or print its value).
Step 9: Repeat Steps 2 to 8 for all nodes in the tree until all nodes are visited.

No concepts available.