Splay Trees: Introduction

Loading...
Lehrplan anzeigen

Kompetenzen, die Sie erwerben

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

Bewertungen

4.6 (3,060 Bewertungen)
  • 5 stars
    73%
  • 4 stars
    22%
  • 3 stars
    4%
  • 2 stars
    1%
  • 1 star
    1%
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.

AS

Nov 23, 2019

The lectures and the reading material were great. The assignments are challenging and require thought before attempting. The forums were really useful when I got stuck with the assignments

Aus der Unterrichtseinheit
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.

Unterrichtet von

  • 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

Durchsuchen Sie unseren Katalog

Melden Sie sich kostenlos an und erhalten Sie individuelle Empfehlungen, Aktualisierungen und Angebote.