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

Coddy

Heaps & Priority Queues - Data Structures Series #7

via Coddy

Overview

In this course, you will learn about the Heap data structure (the backbone of priority queues), create a MinHeap from zero using your preferred language, and practice coding challenges with it!

Prerequisites:

  • Basic object oriented programming knowledge in a language of your choice

Syllabus

Introduction

  • What is a Heap?

MinHeap Project

  • MinHeap Class
  • parent
  • insert
  • peek
  • extractMin
  • size
  • isEmpty

Practice Challenges

  • Practice #1
  • Practice #2
  • Practice #3
  • Practice #4
  • Practice #5

Reviews

Start your review of Heaps & Priority Queues - Data Structures Series #7

Never Stop Learning.

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

Someone learning on their laptop while sitting on the floor.