Splay Trees: Introduction

Loading...
Просмотреть программу курса

Получаемые навыки

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

Рецензии

4.6 (оценок: 3,274)
  • 5 stars
    72.35%
  • 4 stars
    21.71%
  • 3 stars
    4%
  • 2 stars
    0.61%
  • 1 star
    1.31%
TT

Apr 06, 2018

Data Structures was really interesting over all, also assignments are quite challenging. It's important to consult the external references & discussion forums if you want to get the best of it.

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

Из урока
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.

Преподаватели

  • 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

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

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