Splay Trees: Implementation

Loading...
Ver programa

Destrezas que aprenderás

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

Revisiones

4.7 (2,458 calificaciones)
  • 5 stars
    1,812 ratings
  • 4 stars
    519 ratings
  • 3 stars
    88 ratings
  • 2 stars
    15 ratings
  • 1 star
    24 ratings
AS

Nov 23, 2019

The lectures and the reading material were great. The assignments are challenging and require thought before attempting. The forums were really useful when I got stuck with the assignments

AS

Sep 19, 2019

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:

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