Applications

video-placeholder
Loading...
Lehrplan anzeigen

Kompetenzen, die Sie erwerben

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

Bewertungen

4.6 (4,360 Bewertungen)

  • 5 stars
    72,75 %
  • 4 stars
    21,37 %
  • 3 stars
    3,80 %
  • 2 stars
    0,77 %
  • 1 star
    1,28 %

KL

4. Sep. 2020

Filled StarFilled StarFilled StarFilled StarFilled Star

one of the best course i have ever taken on any platform.\n\ni love to learn on coursera platform.\n\ncoursera makes one to think fro solution.\n\nafter completion of course one feel satisfied.

SS

14. Dez. 2020

Filled StarFilled StarFilled StarFilled StarFilled Star

This is one of the appreciable course for the learners. The lectures and the reading material were great and the assignments was challenging. Overall this is a very good platform to learn.

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

  • Placeholder

    Alexander S. Kulikov

    Visiting Professor

  • Placeholder

    Michael Levin

    Lecturer

  • Placeholder

    Daniel M Kane

    Assistant Professor

  • Placeholder

    Neil Rhodes

    Adjunct Faculty

Durchsuchen Sie unseren Katalog

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