Path Compression

Loading...

Destrezas que aprenderás

Binary Search Tree, Priority Queue, Hash Table, Stack (Abstract Data Type), List

Revisiones

4.7 (2,025 calificaciones)
  • 5 stars
    1,493 ratings
  • 4 stars
    432 ratings
  • 3 stars
    70 ratings
  • 2 stars
    11 ratings
  • 1 star
    19 ratings

Amazing course.\n\nInteresting exercises help with learning and understanding of internal mechanisms basic data structures, how some of them work, the pros and cons of each.\n\nThanks!

Perfect course for learning more about fundamental data structures, except for presentations on few difficult topics like splay trees, where explanations can be made more elaborate!

De la lección
Priority Queues and Disjoint Sets

Impartido por:

  • Alexander S. Kulikov

    Alexander S. Kulikov

    Visiting Professor
  • Michael Levin

    Michael Levin

    Lecturer
  • Daniel M Kane

    Daniel M Kane

    Assistant Professor
  • Neil Rhodes

    Neil Rhodes

    Adjunct Faculty

Explora nuestro catálogo

Inscríbete de manera gratuita y obtén recomendaciones personalizadas, actualizaciones y ofertas.