How to convert a Complete Binary Tree to a Priority Search Tree in O(n)
No.  If you could, you'd obtain a sorting algorithm that would run in $O(n)$ time (construct the priority search tree, then traverse the nodes in increasing order of key), but you can't sort in $O(n)$ time.