Is post-order traversal possible on a binary tree that is not arranged (sorted) like the one in this question?

Question

Referring to the following question:

The answer suggests that post-order traversal is not possible. Is this correct?

I am struggling to understand whether the tree