It's a Binary Search Tree solution :) Just fill the tree with the elements from behind(from root), then run the reverse postorder(right side, left side, root).