public boolean full(Tree<V> tree){
    int number = 2;
    while(number < tree.size()){
        number = number * 2;
    }
    if(tree.size()+1 == number){
        return true;
    }else{
        return false;
    }
}