contestada

What are the best case runtimes for AVL Tree search, insertion, and deletion?
1) O(log n) for search, O(log n) for insertion, O(log n) for deletion
2) O(1) for search, O(1) for insertion, O(1) for deletion
3) O(n) for search, O(n) for insertion, O(n) for deletion
4) O(n²) for search, O(n²) for insertion, O(n²) for deletion

Respuesta :

ACCESS MORE
ACCESS MORE
ACCESS MORE
ACCESS MORE

Otras preguntas