What is the easiest way to implement non-recursive version of post order traversal?

I am trying to implement iterative version of post-order traversal and referred various texts one of which is link text

But I didn’t understand and found it complicated. What is the easy way to do it.

PROPOSE THE SOLUTIONS USING SINGLE STACK ONLY

Use threaded binary trees

//