Splay Trees: Implementation

Loading...
Del curso dictado por University of California San Diego
Data Structures
1465 calificaciones
University of California San Diego
1465 calificaciones
Curso 2 de 6 en SpecializationData Structures and Algorithms
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.

Conoce a los instructores

  • Alexander S. Kulikov
    Alexander S. Kulikov
    Visiting Professor
    Department of Computer Science and Engineering
  • Michael Levin
    Michael Levin
    Lecturer
    Computer Science
  • Daniel M Kane
    Daniel M Kane
    Assistant Professor
    Department of Computer Science and Engineering / Department of Mathematics
  • Neil Rhodes
    Neil Rhodes
    Adjunct Faculty
    Computer Science and Engineering

Explora nuestro catálogo

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