(Optional) Splay Trees: Analysis

Loading...
Visualiser le programme de cours

Compétences que vous apprendrez

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

Avis

4.7 (2,279 notes)
  • 5 stars
    1,670 ratings
  • 4 stars
    492 ratings
  • 3 stars
    80 ratings
  • 2 stars
    14 ratings
  • 1 star
    23 ratings
VK

Jul 16, 2018

Amazing course.\n\nInteresting exercises help with learning and understanding of internal mechanisms basic data structures, how some of them work, the pros and cons of each.\n\nThanks!

SC

Feb 27, 2019

Perfect course for learning more about fundamental data structures, except for presentations on few difficult topics like splay trees, where explanations can be made more elaborate!

À partir de la leçon
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.

Enseigné par

  • 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

Explorer notre catalogue

Rejoignez-nous gratuitement et obtenez des recommendations, des mises à jour et des offres personnalisées.