int main(int argc, char *argv[]) {
    vector<string> keyWords = getKeyWords(keywordsTXT);
    // keyWords(to, good, easy, human-engineered, programs, by, generalities)
    Tree arvore;
    arvore.setRoot(arvore.balancedTree(keyWords, 0, keyWords.size()));

Leaf *Tree::balancedTree(vector<string> keyWords, unsigned int start, unsigned int final) {
    if (start > final) {
        printf("Ok n");
        return nullptr;
    }

    int middle = (final + start) / 2;
    Leaf *temp = new Leaf(keyWords[middle]);

    temp->setLeft(balancedTree(keyWords, start, middle - 1));
    temp->setRight(balancedTree(keyWords, middle + 1, final));

    return temp;
}