********IN JAVA**********

The problem is to convert the given Max Heap into a binary search tree (BST) with the condition that the final BST needs to be also a complete binary tree.

Note We assume that:

- The number of elements in the Max Heap tree is always 2^L - 1 , which L is the number of levels in the tree.

- There is no duplicate element in the Max Heap.

Example:

Input (max heap):

7 / \ 6 5 / \ / \ 3 4 1 2

Output (BST):

4 / \ 2 6 / \ / \ 1 3 5 7