(Optional) Splay Trees: Analysis

Loading...
Ver programa

Destrezas que aprenderás

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

Reseñas

4.6 (3,776 calificaciones)
  • 5 stars
    72.11%
  • 4 stars
    21.92%
  • 3 stars
    4.02%
  • 2 stars
    0.71%
  • 1 star
    1.21%
KL
4 de sep. de 2020

one of the best course i have ever taken on any platform.\n\ni love to learn on coursera platform.\n\ncoursera makes one to think fro solution.\n\nafter completion of course one feel satisfied.

SG
27 de oct. de 2019

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.

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

    Visiting 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.