Proof: Upper Bound for Chain Length (Optional)

video-placeholder
Loading...
View Syllabus

Skills You'll Learn

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

Reviews

4.6 (4,134 ratings)
  • 5 stars
    72.73%
  • 4 stars
    21.48%
  • 3 stars
    3.84%
  • 2 stars
    0.74%
  • 1 star
    1.18%
SS
Dec 14, 2020

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.

AS
Sep 18, 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.

From the lesson
Hash Tables

Taught By

  • Placeholder

    Alexander S. Kulikov

    Visiting Professor
  • Placeholder

    Michael Levin

    Lecturer
  • Placeholder

    Daniel M Kane

    Assistant Professor
  • Placeholder

    Neil Rhodes

    Adjunct Faculty

Explore our Catalog

Join for free and get personalized recommendations, updates and offers.