Splay Trees: Implementation

Loading...
加州大学圣地亚哥分校
4.7(2,162 个评分) | 93K 名学生已注册
课程 2(共 6 门,数据结构与算法 专项课程
查看授课大纲

您将学习的技能

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

审阅

4.7(2,162 个评分)
  • 5 stars
    1,582 ratings
  • 4 stars
    473 ratings
  • 3 stars
    74 ratings
  • 2 stars
    13 ratings
  • 1 star
    20 ratings
VK

Jul 16, 2018

Amazing course.\n\nInteresting exercises help with learning and understanding of internal mechanisms basic data structures, how some of them work, the pros and cons of each.\n\nThanks!

SC

Feb 27, 2019

Perfect course for learning more about fundamental data structures, except for presentations on few difficult topics like splay trees, where explanations can be made more elaborate!

从本节课中
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

探索我们的目录

免费加入并获得个性化推荐、更新和优惠。