title: How to check if a given array represents postorder traversal of Binary Search Tree?
body: <p>There is a given array and we need to know if it represents a post-order traversal of BST. (example: if the question was in-order instead of post-order , we only need to check if the array is sorted  time o(n))</p>