Write an efficient program to print the nth node of postorder traversal.
Suppose Binary tree contain following nodes [1,2,3,4,5,6,7].
Given position, and get the node of this position.
View nodes of this tree.
Visualize process Try it Yourself
Program to find nth node of postorder traversal. Time complexity O(n).
Submit your solution in comment.