Applications

video-placeholder
Loading...
シラバスを表示

学習するスキル

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

レビュー

4.6 (5,113 件の評価)

  • 5 stars
    73.28%
  • 4 stars
    21.06%
  • 3 stars
    3.61%
  • 2 stars
    0.70%
  • 1 star
    1.32%

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.

SG

2019年10月27日

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.

講師

  • Placeholder

    Neil Rhodes

    Adjunct Faculty

  • Placeholder

    Daniel M Kane

    Assistant Professor

  • Placeholder

    Michael Levin

    Lecturer

  • Placeholder

    Alexander S. Kulikov

    Professor

コース一覧で検討

サインアップは無料です。今すぐサインアップして、パーソナライズされたお勧め、更新、サービスを利用しましょう。