Complete Binary Trees

Loading...
강의 계획서 보기

배우게 될 기술

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

검토

4.6(3,288개의 평가)
  • 5 stars
    72.35%
  • 4 stars
    21.71%
  • 3 stars
    4.01%
  • 2 stars
    0.60%
  • 1 star
    1.30%
TT

Apr 06, 2018

Data Structures was really interesting over all, also assignments are quite challenging. It's important to consult the external references & discussion forums if you want to get the best of it.

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

Coursera 카탈로그 살펴보기

무료로 참여해 맞춤화된 추천, 업데이트 및 제안을 받아보세요.