template<class T>
void fillTree(vector<T> leaves, CompleteBinTree<T>& tree)
{
//    CompleteBinTree<T> tree;
    int size = leaves.size();
    int usedPositions[size] = {0};
    for(int i = 0; i < size; i++)
        cout << usedPositions[i] << " ";

    int i = 0;
    while(!leaves.empty())
    {
        int position = -1;  //

        srand(time(NULL));
        position = rand() % leaves.size();
        cout << position << endl;
        if(inArray(usedPositions, size, position))
            continue;

        usedPositions[i++] = position;
        tree.addElement(leaves[position]);
        myerase(leaves, position);

    }
    //return tree;
}