#define USECHRONO
#undef HAVE_MPI

#include "eval.hpp"
#include <cassert>
#include <climits>
#include <cstdlib>
#include <stack>
using namespace aed;
using namespace std;

bool even(int x) { return x%2==0; }
bool odd(int x) { return x%2; }
bool ge7(int x) { return x>=7; }
bool le3(int x) { return x<=3; }
bool div4(int x) { return x%4==0; }
bool isprime(int x) { return is_prime(abs(x)); }
bool isnotprime(int x) { return !is_prime(abs(x)); }

//---:---<*>---:---<*>- COMIENZA CODIGO FUNCION --:---<*>---:---<*>---:---<*>
// COMPLETAR DNI y NOMBRE AQUI:
// Nombre: Diego Benitez
int DNI=42602479;
void fillbalance(btree <int> &B,btree <int> :: iterator nodo,list <int> &L){
  int size = L.size();
  list <int> :: iterator it = L.begin();
  if ( L.empty() ) return;
  if ( size == 1 ){
    B.insert(nodo,*L.begin());
    return;
  }
  if ( size > 1 ){
    int nleft = size/2;
    int nright = size-nleft-1;
    list <int> Lleft;
    list <int> Lright;
    for(int i=0;i<nleft;i++) { 
      Lleft.push_back(*it);
      it = L.erase(it);
    }
    nodo = B.insert(nodo,*it);
    it = L.erase(it);
    for(int i=0;i<nright;i++) { 
      Lright.push_back(*it);
      it = L.erase(it);
    }
    fillbalance(B,nodo.left(),Lleft);
    fillbalance(B,nodo.right(),Lright);
  }
}
void fillbalance(btree<int> &B,list<int> &L) {
  if ( L.size() == 0 ) return;
  if ( L.size() == 1 ){
    B.insert(B.begin(),*L.begin());
    return;
  }
  if ( L.size() > 1 ) fillbalance(B,B.begin(),L);
}

//---:---<*>---:---<*>- FINALIZA CODIGO FUNCION --:---<*>---:---<*>---:---<*>
int main() {
  Eval ev;
  int vrbs=0;
  ev.eval<1>(fillbalance,vrbs);
  
  return 0;
}