Considering the following search tree, choose the correct alternative: The root of the tree has a key value of 50. The tree contains 5 leaf nodes...
Considering the following search tree, choose the correct alternative:
The root of the tree has a key value of 50.
The tree contains 5 leaf nodes.
Inserting a node with a key value of 96 keeps the tree balanced.
When calculating the balance factor of each node, according to the properties of an AVL tree, the example tree is unbalanced.
A search operation on the tree above will always visit all of its nodes.
The root of the tree has a key value of 50.
The tree contains 5 leaf nodes.
Inserting a node with a key value of 96 keeps the tree balanced.
When calculating the balance factor of each node, according to the properties of an AVL tree, the example tree is unbalanced.
A search operation on the tree above will always visit all of its nodes.
💡 1 Resposta
Ed 
A alternativa correta é a letra D) A operação de busca na árvore acima não visitará todos os seus nós.
✏️ Responder
Para escrever sua resposta aqui, entre ou crie uma conta
Outros materiais
Perguntas relacionadas
Compartilhar