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 (4,588 calificaciones)

  • 5 stars
    72,88 %
  • 4 stars
    21,36 %
  • 3 stars
    3,74 %
  • 2 stars
    0,76 %
  • 1 star
    1,24 %

SG

27 de oct. de 2019

Filled StarFilled StarFilled StarFilled StarFilled Star

I found the course a little tough, but it's worth the effort. It takes more time than mentioned. Apart from that, it is actually good and covers most of the topics required for interviews.

AS

18 de sep. de 2019

Filled StarFilled StarFilled StarFilled StarFilled Star

The best data structures course that I have taken!\n\nThe complex topics are made simpler at the expense of teaching style that allowed me to make it applicable in a real world situations.

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

    Alexander S. Kulikov

    Professor

  • Placeholder

    Michael Levin

    Lecturer

  • Placeholder

    Daniel M Kane

    Assistant Professor

  • Placeholder

    Neil Rhodes

    Adjunct Faculty

Explora nuestro catálogo

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