Splay Trees: Implementation

Loading...
查看授課大綱

您將學習的技能

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

審閱

4.6(2,854 個評分)
  • 5 stars
    73%
  • 4 stars
    21%
  • 3 stars
    4%
  • 2 stars
    1%
  • 1 star
    1%
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.

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

探索我們的目錄

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