Applications

video-placeholder
Loading...
查看授課大綱

您將學習的技能

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

審閱

4.6(4,186 個評分)
  • 5 stars
    72.76%
  • 4 stars
    21.50%
  • 3 stars
    3.79%
  • 2 stars
    0.76%
  • 1 star
    1.17%
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.

SS
2020年12月14日

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.

從本節課中
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

    Alexander S. Kulikov

    Visiting Professor
  • Placeholder

    Michael Levin

    Lecturer
  • Placeholder

    Daniel M Kane

    Assistant Professor
  • Placeholder

    Neil Rhodes

    Adjunct Faculty

探索我們的目錄

免費加入並獲得個性化推薦、更新和優惠。