Skip to main content

Data Structures & Algorithms II: Binary Trees, Heaps, Skiplists, and Hashmaps

Massive Open Online Course
  • Overview
  • Course Content
  • Requirements & Materials

Data Structures & Algorithms II: Binary Trees, Heaps, Skiplists, and Hashmaps

Course Description

This Data Structures & Algorithms course extends beyond linear data structures to the nonlinear and hierarchical data structures. 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, while investigating different collision strategies and implement one. A short Java review is presented on topics relevant to new data structures is also covered in this course.

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.

Course Content





Requirements & Materials


  • Basic knowledge of the Java programming language, object-oriented principles, and the introductory data structures: arrays, linkedlists, stacks, queues, and deques.


  • Internet connection (DSL, LAN, or cable connection desirable)

Who Should Attend

This course is designed for anyone who wants to learn about nonlinear and hierarchical data structures; study binary trees, BSTs, and heaps; understand tree operations and algorithms; implement Hashmaps that store data using key-value pairs; or explore probabilistic data structures like Skiplists. Course tools will help visualize structures and performance.

Adult professional learning on a laptop

What You Will Learn

  • Mature Java programming skills by using recursion in tree ADTs
  • The different nonlinear, linked data structures: Trees, Heaps, SkipLists, and HashMaps
  • The significant uses and applications of hierarchical tree structures
  • Tree properties and categorizing based on shape and order
  • How to design and implement the binary trees: BSTS and Heaps
  • How to compute amortized analysis for BSTs, Heaps, HashMaps, and SkipLists
Female professional in computer science lab looking at tablet

How You Will Benefit

  • Experience in examining edge cases and efficiency that occur in BST and Heap operations.
  • Understand the up-heap, down-heap, and build-heap procedures.
  • Consider the probabilistic data structure, SkipLists, and randomization.
  • Implement the HashMap ADT with its key-value pairs.
  • Analyze the different collision strategies with HashMaps.
  • Grow Your Professional Network
  • Taught by Experts in the Field
Want to see all Massive Open Online Courses? section icon

Want to see all Massive Open Online Courses?

The course schedule was well-structured with a mix of lectures, class discussions, and hands-on exercises led by knowledgeable and engaging instructors.

- Abe Kani

Frequently Asked Questions

How do MOOCs work?

Designed for an online audience, MOOCs are available to anyone with an internet connection and are free to enroll. Some MOOCs can be started any time – others at regular intervals – and range in length from a few weeks to a few months to complete. You’ll have access to a wide range of online media and interactive tools, including video lectures, class exercises, discussions, and assessments.

Who can enroll in MOOCs?

Anyone with an internet connection can enroll. Sme courses may be unavailable in a small number of countries because of trade restrictions or government policies.

How do you enroll in a MOOC?

Visit a MOOC provider platforms — edX, Coursera, or Udacity — to enroll in a MOOC. Then, watch the pre-recorded lectures, learn from the course readings, and complete related work, like quizzes and in some cases, final projects.

How much do MOOCs cost?

Most courses are free, though there is a small fee if you opt to work towards a certificate of completion. Some courses count toward university credit—and some, like our online master’s program in computer science, offer a full degree. These credit-bearing courses do have fees and applications associated with them.

MOOC Credentials
Can I receive CEUs from completed a MOOC?

Yes, Georgia Tech offers CEUs for some completed MOOC courses taken through Coursera and edX. You have the option of purchasing CEUs after earning a verified course certificate.

What is a digital badge?

A digital badge is an acknowledgement that you've successfully completed a MOOC course. You can display your digital badge on your online profiles so that colleagues and employers can see your achievements at a glance.

What other credentials are available after completing a MOOC?

You can earn CEUs, digital badges, and verified certificates of completion. You can also use MOOCs as an alternate pathway to enter Georgia Tech master's programs through The Analytics: Essential Tools and Methods MicroMasters and the Online Master's in Computer Science.

Who issues the transcript or completion certification?

Certificates of completion are issued by the online providers edX, Coursera, and Udacity. Although they are a great way to showcase your skills, they are not the same as official academic credit from Georgia Tech. However, if you purchase CEUs (which are denoted by a badge), then you can request an official GTPE transcript for free.

Want to learn more about this course?