1. Write an efficient implementation of the function void Rebuild(). This function stores the nodes of the BST in an array and then clears the tree and rebuilds it again from scratch, such that the newly built tree is balanced.

HINT: Think of the order in which the tree nodes need to be stored in the array. Think also of the order in which the elements in the array need to be inserted into the tree in order to get a balanced tree. (6 points)

c++