Naive Implementations of Priority Queues

Loading...
查看授課大綱

您將學習的技能

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

審閱

4.7(2,377 個評分)
  • 5 stars
    1,750 ratings
  • 4 stars
    504 ratings
  • 3 stars
    86 ratings
  • 2 stars
    15 ratings
  • 1 star
    22 ratings
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

Sep 19, 2019

The best data structures course that I have taken!\n\nThe complex topics are made simpler at the expense of teaching style that allowed me to make it applicable in a real world situations.

從本節課中
Priority Queues and Disjoint Sets

教學方

  • 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

探索我們的目錄

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