c++11: Why would you use a hash table over an AVL Tree for determining if a value was seen before? Is a hash table a better choice?

dimanche 28 juillet 2019

Why would you use a hash table over an AVL Tree for determining if a value was seen before? Is a hash table a better choice?

Is there ever a case where an AVL Tree would be a better choice?

Aucun commentaire:

Enregistrer un commentaire

Inscription à : Publier les commentaires (Atom)