Splay Trees: Implementation

Loading...
강의 계획서 보기

배우게 될 기술

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

검토

4.7(2,512개의 평가)
  • 5 stars
    1,850 ratings
  • 4 stars
    530 ratings
  • 3 stars
    91 ratings
  • 2 stars
    15 ratings
  • 1 star
    26 ratings
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.

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.

수업에서
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

Coursera 카탈로그 살펴보기

무료로 참여해 맞춤화된 추천, 업데이트 및 제안을 받아보세요.