int isFull(const Node* t)
{
  if(t == NULL) return 0;
  else {
    int x = isFull(t->left);
    int y = isFull(t->right);
    if(x >= 0 && x == y) return x + 1;
    else return -1;
  }
}