21 void auxApagaTree (
Node*);
22 void auxInserir (
Node *&,
int) ;
23 void auxRemoverNodo (
Node *&,
int) ;
32 Node* procurarNodo (
int matricula);
bool estaVazia()
Definition: BinaryTree.cpp:61
~BinaryTree()
Definition: BinaryTree.cpp:25
Node * removerMenorValor(Node *&)
Definition: BinaryTree.cpp:129
Definition: BinaryTree.h:19
void removerNodo(int matricula)
Definition: BinaryTree.cpp:49
void inserirNodo(int matricula)
Definition: BinaryTree.cpp:41
BinaryTree()
Definition: BinaryTree.cpp:18