Splay Trees: Implementation

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,388 évaluations)
  • 5 stars
    1,760 ratings
  • 4 stars
    505 ratings
  • 3 stars
    86 ratings
  • 2 stars
    15 ratings
  • 1 star
    22 ratings
SG

Oct 28, 2019

I found the course a little tough, but it's worth the effort. It takes more time than mentioned. Apart from that, it is actually good and covers most of the topics required for interviews.

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.

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