Exercise $3(4)-1$ Trees

Write a recursive Java method $n$ thPostorder that given a binary tree and a number $n,$ the program finds the $n-$th node in the Postorder traversal of the given Binary tree.