CodeSignal – The Duolingo of Coding Practice

Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Georgia Institute of Technology

Data Structures & Algorithms II: Binary Trees, Heaps, SkipLists and HashMaps

Georgia Institute of Technology via edX

Go to class Write review

Overview

This Data Structures & Algorithms course extends beyond linear data structures in CS1332xI to the nonlinear and hierarchical data structures here in CS1332xII. A short Java review is presented on topics relevant to new data structures covered in this course. The course does require prior knowledge of Java, object-oriented programming and linear data structures. Time complexity is threaded throughout the course within all the nonlinear data structures and algorithms.

You will explore the hierarchical data structure of trees. Trees have important properties such as shape and order which are used to categorize trees into different groups and define their functionality. The course begins by explaining Binary Trees and two subgroups: Binary Search Trees (BSTs) and Binary Heaps. You will program BSTs, their operations and traversal algorithms. BSTs are an important structure when wanting to access information quickly. Heaps approach access differently and prioritize what data is accessed. Heaps also employ the concept of up-heap and down-heap operations not found in other structures.

HashMaps and SkipLists are the last data structures discussed in the course. The HashMap ADT is a collection of key-value pairs. The key-value pairs are stored in an unordered manner based on hash codes and compression functions that translate keys into integers. You will investigate different collision strategies and implement one. SkipLists are a probabilistic data structures where data is placed in the structure based on a randomization procedure.

The course design has several components and is built around modules. A module consists of a series of short (3-5 minute) instructional videos. In between the videos, there are textual frames with additional content information for clarification, as well as video errata dropdown boxes. All modules include an Exploratory Lab that incorporates a Visualization Tool specifically designed for this course. The lab includes discovery questions that lead you towards delving deeper into the efficiency of the data structures and examining the edge cases. This is followed by a set of comprehension questions on topics covered in the module that count for 10% of your grade. The modules end with Java coding assignments which are 60% of your grade. Lastly, you'll complete a course exam, which counts for the remaining 30% of your grade.

Syllabus

Module 0: Introduction and Review

  • Review of important Java principles involved in object-oriented design
  • The Iterator & Iterable design patterns, and the Comparable & Comparator interfaces
  • Basic “Big-Oh” notation and asymptotic analysis

Module 4: Binary Search Tree (BST) Introduction

  • Learn about the non-linear, linked data structure, Trees, and the important submodels: Binary Trees and Binary Search Trees (BST)
  • Acquire a working knowledge of the tree structure, including principles, properties and numerical concepts
  • Examine traversal algorithms for BSTs, the resulting order and the information obtained by each

Module 5: BST Operations & SkipLists

  • Extend understanding of tree structures and their impact on search operations
  • Study and implement efficient procedures for the search, add and remove operations in BSTs
  • Apply the concept of pointer reinforcement restructuring recursion technique to the add and remove operations
  • Investigate the probabilistic data structure, SkipLists, and the implications of randomization on data structures

Module 6: Binary Heaps

  • Explore the Binary Heap tree data structure and its additional property constraints that differentiate it from BSTs
  • Delve into the add and remove operations that require the up-heap and down-heap procedures
  • Explore the efficient bottom-up build heap algorithm

Module 7: HashMaps

  • Study HashMaps designed for efficient storage and retrieval based on the concept of unique keys paired with values
  • Learn about hash functions, hash codes and compression functions while implementing a basic HashMap
  • Investigate data collisions and the strategies to resolve data collisions from external chaining to linear and quadratic probing to double hashing

Taught by

Mary Hudachek-Buswell

Tags

Reviews

5.0 rating, based on 7 Class Central reviews

4.9 rating at edX based on 12 ratings

Start your review of Data Structures & Algorithms II: Binary Trees, Heaps, SkipLists and HashMaps

  • Anonymous
    This course is well laid out and effectively teaches the fundamentals of these four frequently used data structures, building on DS&A I. The coding assignments are extremely useful and solidified my understanding of the structures introduced in the…
  • Anonymous
    Very comprehensive, it’s very hard to find classes that’s up to quality as the ones you’d find in actual universities. This course delivers in the difficulty of its material while also explaining the material clearly the with the videos provided by Dr HB.
    The test and programming assignments force you to come out with practical knowledge and I’m grateful for Dr HB for making her GAtech cs1332 accessible for everyone
  • René Salas
    This is an excellent course that reinforces the concepts with a variaty of activities after each lecture. Some online courses just give you the concepts and have a brief activity after each lecture, but this course has a solid set of activities (coding, comprehension questions, analysis labs) that really help to grasp and remember the subjects taught. Besides, the video and written lectures are excellent, detailed and clear with lots of examples. I completed part I & II of the Data Structures & Algorithms set of courses and I am looking forward to go on into part III.

    Thanks for this amazing course.
  • Anonymous
    The lectures and problem sets are of a high standard -- the material is challenging for newcomers, but the quality of instruction offsets conceptual difficulty. I would definitely recommend the class to anyone looking to learn or brush up on these specific data structures and algorithms. Thanks for a great class!
  • Profile image for Douglas
    Douglas
    Excellent course, but more difficult than course I. Worth it, but make sure you'll have the time to put in the necessary work if you the concepts are new to you.
    If you already know the concepts, than it'll probably be easier.
  • Anonymous
    Awesome course, really enjoyed the varied content and the concise lectures. Highly recommend and am looking forward to parts 3 and 4.
  • Profile image for Anton Nikulin
    Anton Nikulin
    Interesting, and well organized course.
    One of the best course on algorithms on the web. Highly recommend it!
Go to class

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.