Given an efficient algorithm that computes and prints, for every position p of a tree T, the element of p followed by the height of ps subtree.

(Hint: Use a postorder traversal). In Java, please.