Splay Trees: Implementation

From the course by Калифорнийский университет в Сан-Диего
Data Structures
1322 ratings
Калифорнийский университет в Сан-Диего
1322 ratings
Course 2 of 6 in the Specialization Data Structures and Algorithms
From the lesson
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.

Meet the Instructors

  • Alexander S. Kulikov
    Alexander S. Kulikov
    Visiting Professor
    Department of Computer Science and Engineering
  • Michael Levin
    Michael Levin
    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

Ознакомьтесь с нашим каталогом

Присоединяйтесь бесплатно и получайте персонализированные рекомендации, обновления и предложения.