Splay Trees: Implementation

Loading...
Do curso por University of California San Diego
Data Structures
1325 ratings
University of California San Diego
1325 ratings
Curso 2 de 6 em Specialization Data Structures and Algorithms
Na lição
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.

Conheça os instrutores

  • 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

Explore nosso catálogo

Registre-se gratuitamente e obtenha recomendações, atualizações e ofertas personalizadas.