Applications

video-placeholder
Loading...
Ver programa

Destrezas que aprenderás

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

Reseñas

4.6 (5,106 calificaciones)

  • 5 stars
    73,26 %
  • 4 stars
    21,09 %
  • 3 stars
    3,62 %
  • 2 stars
    0,68 %
  • 1 star
    1,33 %

KL

4 de sep. de 2020

one of the best course i have ever taken on any platform.

i love to learn on coursera platform.

coursera makes one to think fro solution.

after completion of course one feel satisfied.

SS

14 de dic. de 2020

This is one of the appreciable course for the learners. The lectures and the reading material were great and the assignments was challenging. Overall this is a very good platform to learn.

De la lección

Binary Search Trees 2

In this module we continue studying binary search trees. We study a few non-trivial applications. We then study the new kind of balanced search trees - Splay Trees. They adapt to the queries dynamically and are optimal in many ways.

Impartido por:

  • Placeholder

    Neil Rhodes

    Adjunct Faculty

  • Placeholder

    Daniel M Kane

    Assistant Professor

  • Placeholder

    Michael Levin

    Lecturer

  • Placeholder

    Alexander S. Kulikov

    Professor

Explora nuestro catálogo

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