is the construction of a binary heap in O(n) time or reporting the elements in sorted order from a binary search tree in O(n) time a contradiction to the lower bound for sorting ? Justify your answer