void imprimeArv(Node * a){
if (a != NULL){
imprimeArv(a->left);
printf("%d ", a->data);
imprimeArv(a->right);
}
}
int main(){
arvore* a = criaArvore();
adicionaElem(&(a->raiz), 10, a);
adicionaElem(&(a->raiz), 3, a);
adicionaElem(&(a->raiz), 8, a);
adicionaElem(&(a->raiz), 5, a);
adicionaElem(&(a->raiz), 6, a);
adicionaElem(&(a->raiz), 4, a);
adicionaElem(&(a->raiz), 9, a);
adicionaElem(&(a->raiz), 2, a);
adicionaElem(&(a->raiz), 1, a);
adicionaElem(&(a->raiz), 11, a);
imprimeArv(a->raiz);
printf("-----------------------\n");
noAvo = NULL;
noPai = NULL;
removeElem(&(a->raiz), 8, a);
printf("Raiz: %d\n", a->raiz->elem);
imprimeArv(a->raiz);
printf("-----------------------\n");
return 0;
}
int main(){
/*
Node * raiz = novoNode(4);
raiz = insertTree(raiz, 2);
raiz = insertTree(raiz, 6);
raiz = insertTree(raiz, 1);
raiz = insertTree(raiz, 3);
raiz = insertTree(raiz, 5);
raiz = insertTree(raiz, 7);
raiz = insertTree(raiz, 8);
raiz = insertTree(raiz, 10);
raiz = insertTree(raiz, 9);
*/
Node * raiz = novoNode(2);
raiz = insertTree(raiz, 1);
raiz = insertTree(raiz, 3);
raiz = insertTree(raiz, 8);
raiz = insertTree(raiz, 10);
raiz = insertTree(raiz, 9);
imprimeArv(raiz);
printf("\n");
Node * achar = searchInOrder(raiz, 1);
printf("%d\n", achar->data);
raiz = removeNode(raiz, 10);
imprimeArv(raiz);
printf("\n");
return 0;
}
int main(){
Node * raiz = novoNode(1);
raiz = insertTree(raiz, 2);
raiz = insertTree(raiz, 3);
/*
Node * raiz = novoNode(4);
raiz = insertTree(raiz, 2);
raiz = insertTree(raiz, 6);
raiz = insertTree(raiz, 1);
raiz = insertTree(raiz, 3);
raiz = insertTree(raiz, 5);
raiz = insertTree(raiz, 7);
raiz = insertTree(raiz, 8);
raiz = insertTree(raiz, 10);
raiz = insertTree(raiz, 9);
*/
/*
Node * raiz = novoNode(2);
raiz = insertTree(raiz, 1);
raiz = insertTree(raiz, 3);
*/
imprimeArv(raiz);
printf("\n");
//raiz = removeOcorrencias(raiz, 2);
//imprimeArv(raiz);
//printf("\n");
//printf("Maiores: %d\n", elementosMaioresQue(raiz, 1));
printf("Altura: %d\n", alturaDeArvore(raiz));
return 0;
}
