Applications

video-placeholder
Loading...
강의 계획표 보기

배우게 될 기술

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

검토

4.6개(4,944개 평가)

  • 5 stars
    73.13%
  • 4 stars
    21.23%
  • 3 stars
    3.62%
  • 2 stars
    0.70%
  • 1 star
    1.29%

KL

2020년 9월 4일

one of the best course i have ever taken on any platform.

i love to learn on coursera platform.

coursera makes one to think fro solution.

after completion of course one feel satisfied.

AS

2019년 9월 18일

The best data structures course that I have taken!

The complex topics are made simpler at the expense of teaching style that allowed me to make it applicable in a real world situations.

수업에서

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.

강사:

  • Placeholder

    Neil Rhodes

    Adjunct Faculty

  • Placeholder

    Daniel M Kane

    Assistant Professor

  • Placeholder

    Michael Levin

    Lecturer

  • Placeholder

    Alexander S. Kulikov

    Professor

Coursera 카탈로그 살펴보기

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